Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben

DOI10.1080/02331938808843387zbMath0656.90072OpenAlexW1973451811MaRDI QIDQ3804451

Jürgen Sommerschuh

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

knapsack problemsfixing of variableslinear mixed integer problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Boolean programming (90C09)

Related Items (2)

An improved enumeration for pure 0-1 programs ⋮ Verzweigungsstrategien in branch and bound-algorithmen für gemischt-ganzzahlige lineare 0-1-optimierungsanfgaben

Cites Work

• Zero-one integer programs with few contraints - lower bounding theory
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Untersuchungen zu speziellen linearen gemischt-ganzzahligen 0-1-optimierungsaufgaben
• An Algorithm for Large Zero-One Knapsack Problems
• Reduction Algorithm for Zero-One Single Knapsack Problems
• Resolution of the 0–1 knapsack problem: Comparison of methods
• An Algorithm for the Solution of 0-1 Loading Problems
• An Efficient Algorithm for the 0-1 Knapsack Problem
• An algorithm for the 0/1 Knapsack problem

This page was built for publication: Variablenfixierungen in gemischt-ganzzahligen linearen 0-1-Optimierungsaufgaben