Zero-one integer programs with few constraints - Efficient branch and bound algorithms
From MaRDI portal
Recommendations
- 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
Cites work
- 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
Cited in
(12)- A survey of algorithms for the generalized assignment problem
- Efficient solutions for special zero-one programming problems
- An analysis of six greedy selection rules on a class of zero-one integer programming models
- Heuristic methods and applications: A categorized survey
- Heuristics for the multi-resource generalized assignment problem
- MineReduce: an approach based on data mining for problem size reduction
- A heuristic with tie breaking for certain 0–1 integer programming models
- Zero-one integer programs with few contraints - lower bounding theory
- A solution procedure for general knapsack problems with a few constraints
- A trust branching path heuristic for zero-one programming
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- A simple strategy for solving a class of 0-1 integer programming models
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)
