Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen

DOI10.1080/02331939008843628zbMath0716.90084OpenAlexW2087309945MaRDI QIDQ3204333

Manfred Mendel, Ernst-Peter Beisel

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-boundenumerationbounding criteria

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• An Automatic Method of Solving Discrete Programming Problems
• Generalized implicit enumeration using bounds on variables for solving linear programs with zero‐one variables
• Unnamed Item
• Unnamed Item

This page was built for publication: Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen