Enumerative Methods in Integer Programming

DOI10.1016/S0167-5060(08)70347-9zbMath0407.90059MaRDI QIDQ4194734

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 Vancouver (Search for Journal in Brave)

zbMATH Keywords

BibliographyEnumerationBoundsSurveyBranch and BoundCutsInteger ProgrammingHeuristic AlgorithmSearch Trees

Mathematics Subject Classification ID

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

Related Items

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