Bi-dimensional knapsack problems with one soft constraint
From MaRDI portal
Publication:1652049
DOI10.1016/j.cor.2016.07.012zbMath1391.90533OpenAlexW2499304758MaRDI QIDQ1652049
Kathrin Klamroth, Britta Schulze, José Rui Figueira, Luís Paquete
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.012
dynamic programmingsensitivity analysissoft constraintsbi-objective knapsack problembi-dimensional knapsack problem
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions, Nonconvex constrained optimization by a filtering branch and bound
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the representation of the search region in multi-objective optimization
- On an exact method for the constrained shortest path problem
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- Constrained optimization using multiple objective programming
- Solving efficiently the 0-1 multi-objective knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Sensitivity analysis for knapsack problems: Another negative result
- Sensitivity analysis for knapsack problems: A negative result
- The multidimensional 0-1 knapsack problem: an overview.
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- Discrete Dynamic Programming and Capital Allocation
- On the Solution of Discrete Programming Problems
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Bicriteria Transportation Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Random knapsack in expected polynomial time
