Solving efficiently the 0-1 multi-objective knapsack problem
From MaRDI portal
Publication:947962
DOI10.1016/j.cor.2007.09.009zbMath1175.90323OpenAlexW2065148320MaRDI QIDQ947962
Hadrien Hugot, Daniel Vanderpooten, Cristina Bazgan
Publication date: 8 October 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.09.009
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
AN OPTIMIZATION MODEL FOR REUSE SCENARIO SELECTION CONSIDERING RELIABILITY AND COST IN SOFTWARE PRODUCT LINE DEVELOPMENT, Dynamic programming algorithms for the bi-objective integer knapsack problem, Cross entropy for multiobjective combinatorial optimization problems with linear relaxations, Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems, A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem, Solution approaches for equitable multiobjective integer programming problems, A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods, Choquet optimal set in biobjective combinatorial optimization, Bi-dimensional knapsack problems with one soft constraint, Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems, Multi-directional local search, Estimation of distribution algorithms using Gaussian Bayesian networks to solve industrial optimization problems constrained by environment variables, Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem, Approximation Methods for Multiobjective Optimization Problems: A Survey, Network Models for Multiobjective Discrete Optimization, Interactive procedure for a multiobjective stochastic discrete dynamic problem, Computing representations using hypervolume scalarizations, Optimal selection of touristic packages based on user preferences during sports mega-events, On a biobjective search problem in a line: formulations and algorithms, Computing efficiently the nondominated subset of a set sum, Dynamic programming with ordered structures: Theory, examples and applications, Ordinal optimization through multi-objective reformulation, Efficient reductions and algorithms for subset product, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems, Connectedness of efficient solutions in multiple objective combinatorial optimization, Lorenz dominance based algorithms to solve a practical multiobjective problem, A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem, Bridging game theory and the knapsack problem: a theoretical formulation, Multi-objective branch and bound, A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems, Greedy algorithms for a class of knapsack problems with binary weights, Solving 0-1 knapsack problems based on amoeboid organism algorithm, The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem, Approximate Pareto sets of minimal size for multi-objective optimization problems, The binary knapsack problem with qualitative levels, What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods?, An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets, On embedding subclasses of height-balanced trees in hypercubes, An extension of the non-inferior set estimation algorithm for many objectives, Implementing an efficient fptas for the 0-1 multi-objective knapsack problem, Labeling algorithms for multiple objective integer knapsack problems, Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems, Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms, The multiobjective multidimensional knapsack problem: a survey and a new approach, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- Bound sets for biobjective combinatorial optimization problems
- Heuristic algorithms for the multiple knapsack problem
- 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.
- Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
- A bicriteria knapsack program for planning remediation of contaminated lightstation sites
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Relocation problems arising in conservation biology
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems
- Approximating Multiobjective Knapsack Problems
- Discrete Dynamic Programming and Capital Allocation
- Generating the Discrete Efficient Frontier to the Capital Budgeting Problem
- On Finding the Maxima of a Set of Vectors
- Multicriteria Optimization
