An improved enumeration for pure 0-1 programs

DOI10.1080/02331939108843664zbMath0746.90039OpenAlexW2002230487MaRDI QIDQ3978584

Jürgen Sommerschuh

Publication date: 25 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843664

zbMATH Keywords

branch and boundenumerationLP relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09) Numerical methods of relaxation type (49M20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Some computational results on real 0-1 knapsack problems
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben
• Reduction Algorithm for Zero-One Single Knapsack Problems
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An algorithm for the 0/1 Knapsack problem
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming

This page was built for publication: An improved enumeration for pure 0-1 programs