Zero-one integer programs with few constraints - Efficient branch and bound algorithms
The 0-1 integer programming problem and its special case, the 0-1 knapsack problem are frequently encountered in modeling various design and decision making processes. This paper is a follow-up paper to an earlier paper of the authors [ibid. 21, 213-224 (1985; Zbl 0569.90057)] and deals with the development of an effective solution procedure for 0-1 integer programs with few constraints. Detailed computational experiments are carried out and different separation, branching and bounding rules are compared using an experimental branch and bound code. An efficient branch and bound procedure is developed, tested and compared with previously developed optimal algorithms. It is suggested that this procedure may also be used as a heuristic method for large problems by early termination of the tree search. This scheme is tested and found to be very effective.
- Zero-one integer programs with few contraints - lower bounding theory
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- A trust branching path heuristic for zero-one programming
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- 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
- Zero-one integer programs with few contraints - lower bounding theory
- A trust branching path heuristic for zero-one programming
- Zero-one integer programs with few contraints - lower bounding theory
- A simple strategy for solving a class of 0-1 integer programming models
- A survey of algorithms for the generalized assignment problem
- Heuristic methods and applications: A categorized survey
- MineReduce: an approach based on data mining for problem size reduction
- An analysis of six greedy selection rules on a class of zero-one integer programming models
- A heuristic with tie breaking for certain 0–1 integer programming models
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Heuristics for the multi-resource generalized assignment problem
- A solution procedure for general knapsack problems with a few constraints
- Efficient solutions for special zero-one programming problems
This page was built for publication: Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073718)
