The multiobjective multidimensional knapsack problem: a survey and a new approach
From MaRDI portal
Publication:2865172
DOI10.1111/j.1475-3995.2011.00840.xzbMath1277.90116arXiv1007.4063OpenAlexW2082003798MaRDI QIDQ2865172
Thibaut Lust, Jacques jun. Teghem
Publication date: 29 November 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4063
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (27)
Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ Anytime Pareto local search ⋮ Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Many-objective Pareto local search ⋮ Proper balance between search towards and along Pareto front: biobjective TSP case study ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ Systematic reviews as a metaknowledge tool: caveats and a review of available options ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ Ordinal optimization through multi-objective reformulation ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ 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 ⋮ A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ The binary knapsack problem with qualitative levels ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ Learning-based multi-objective evolutionary algorithm for batching decision problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Bound sets for biobjective combinatorial optimization problems
- Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Multi-start and path relinking methods to deal with multiobjective Knapsack problems
- Solving efficiently the 0-1 multi-objective knapsack problem
- Two-phase Pareto local search for the biobjective traveling salesman problem
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Nonlinear multiobjective optimization
- Optimization by ghost image processes in neural networks
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- Guided local search and its application to the traveling salesman problem
- 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
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack 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 Algorithm for Large Zero-One Knapsack Problems
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Multi‐objective combinatorial optimization problems: A survey
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Evolutionary Computation in Combinatorial Optimization
- Handbook of metaheuristics
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: The multiobjective multidimensional knapsack problem: a survey and a new approach
