Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben

DOI10.1080/02331938908843474zbMath0676.90051OpenAlexW2020618889MaRDI QIDQ3832318

Jürgen Sommerschuh

Publication date: 1989

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundlinear relaxationbranching strategiessurrogate constraintpseudo-solutionsmixed Boolean programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)

Related Items (1)

An improved enumeration for pure 0-1 programs

Cites Work

• Experiments in integer programming
• Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben
• An Algorithm for Large Zero-One Knapsack Problems
• Discrete Programming by the Filter Method

This page was built for publication: Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben