A note on the max-min 0-1 knapsack problem

DOI10.1023/A:1009821323279zbMath0935.90024MaRDI QIDQ1304387

Hiroshi Iida

Publication date: 17 February 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundlinear programming relaxationsurrogate relaxationmax-min 0-1 knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Related Items (12)

Robust optimization approach for a chance-constrained binary knapsack problem ⋮ Hybrid approaches for the two-scenario max-min knapsack problem ⋮ Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ Recoverable robust knapsacks: the discrete scenario case ⋮ An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem ⋮ A note on upper bounds to the robust knapsack problem with discrete scenarios ⋮ A randomized algorithm for the min-Max selecting items problem with uncertain weights ⋮ A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem ⋮ A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem

This page was built for publication: A note on the max-min 0-1 knapsack problem