Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
From MaRDI portal
Publication:1043327
DOI10.1016/j.ejor.2009.06.024zbMath1177.90341OpenAlexW1963598301MaRDI QIDQ1043327
George Mavrotas, Kostas Florios, Danae Diakoulaki
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.024
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)
Related Items
Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Multi-directional local search ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Multi-objective optimization using statistical models ⋮ An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ Bridging game theory and the knapsack problem: a theoretical formulation ⋮ Multi-objective branch and bound ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ The multiobjective multidimensional knapsack problem: a survey and a new approach ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A review of interactive methods for multiobjective integer and mixed-integer programming
- On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Solving efficiently the 0-1 multi-objective knapsack problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Heuristic algorithms for the multiple knapsack problem
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- An interactive heuristic method for multi-objective combinatorial optimization
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic
- A discussion of scalarization techniques for multiple objective integer programming
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximating Multiobjective Knapsack Problems
- An Automatic Method of Solving Discrete Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Evolutionary Computation in Combinatorial Optimization
