Zero-one integer programs with few constraints - Efficient branch and bound algorithms

DOI10.1016/0377-2217(85)90113-4zbMath0588.90060OpenAlexW2029446116MaRDI QIDQ1073718

Hasan Pirkul, Bezalel Gavish

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90113-4

zbMATH Keywords

computational experimentsbranch and bound proceduresurrogate relaxation0-1 knapsack problemfew constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Related Items

Heuristics for the multi-resource generalized assignment problem, MineReduce: an approach based on data mining for problem size reduction, A solution procedure for general knapsack problems with a few constraints, A survey of algorithms for the generalized assignment problem, Heuristic methods and applications: A categorized survey, Zero-one integer programs with few contraints - lower bounding theory

Uses Software

• SCICONIC

Cites Work

• Zero-one integer programs with few contraints - lower bounding theory
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• An Algorithm for Large Zero-One Knapsack Problems
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem