Constructive dual methods for discrete programming
From MaRDI portal
Publication:1101341
DOI10.1016/0166-218X(87)90014-XzbMath0642.90078MaRDI QIDQ1101341
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
relaxation approximation; knapsack problems; discrete programming; constructive dual methods; no duality gap; reduction of the feasibility set
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C09: Boolean programming
Related Items
Improved Lagrangean decomposition: An application to the generalized assignment problem, A revised bound improvement sequence algorithm, A bound-improving approach to discrete programming problems
Uses Software
Cites Work
- Unnamed Item
- The bound improving sequence algorithm
- An algorithm for the solution of the 0-1 knapsack problem
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- A bound-improving approach to discrete programming problems
- An Algorithm for Large Zero-One Knapsack Problems
- A Convergent Duality Theory for Integer Programming