Enumerative Methods in Integer Programming

DOI10.1016/S0167-5060(08)70347-9MaRDI QIDQ4194734zbMATH OpenFDO

Authors Kurt Spielberg

Publication date 1979

Published in Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70347-9

zbMATH Keywords

BibliographyBoundsBranch and BoundCutsEnumerationHeuristic AlgorithmInteger ProgrammingSearch TreesSurvey

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Cited in

(6)

• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• On maintenance scheduling of production units
• A heuristic decomposition approach to optimal control in a water supply model
• Calculating uncertainty intervals in approximate equation systems
• IP over 40+ years at IBM scientific centers and marketing
• Classical cuts for mixed-integer programming and branch-and-cut

This page was built for publication: Enumerative Methods in Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4194734)