Data dependent worst case bound improving techniques in zero-one programming
From MaRDI portal
Publication:811361
DOI10.1016/0377-2217(91)90314-LzbMath0734.90059MaRDI QIDQ811361
Publication date: 1991
Published in: European Journal of Operational Research (Search for Journal in Brave)
Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
Data dependent worst case bounds for weighted set packing ⋮ Efficient solutions for special zero-one programming problems
Cites Work
- A new polynomial-time algorithm for linear programming
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Worst-Case Analysis of Heuristic Algorithms
- Approximate Algorithms for the 0/1 Knapsack Problem
- Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
This page was built for publication: Data dependent worst case bound improving techniques in zero-one programming
