Fifty-plus years of combinatorial integer programming

DOI10.1007/978-3-540-68279-0_12MaRDI QIDQ3565241zbMATH OpenOpenAlexFDO

Authors William Cook

Publication date 3 June 2010

Published in 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68279-0_12

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)

Recommendations

• Mixed integer programming computation
• Evolution and state-of-the-art in integer programming
• Integer programming: methods, uses, computation
• Extracts from the history of combinatorial optimization
• scientific article; zbMATH DE number 3908168

Cited in

(12)

• Gap inequalities for non-convex mixed-integer quadratic programs
• A new separation algorithm for the Boolean quadric and cut polytopes
• Last fifty years of integer linear programming: a focus on recent practical advances
• On the History of Combinatorial Optimization (Till 1960)
• Complexity results for the gap inequalities for the max-cut problem
• A polyhedral approach to the single row facility layout problem
• Graphs and algorithms in communication networks on seven league boots
• Mixed integer linear programming formulation techniques
• On the complexity of surrogate and group relaxation for integer linear programs
• New valid inequalities for the fixed-charge and single-node flow polytopes
• Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
• The Boolean quadric polytope

Describes a project that uses

Uses Software

• LOLIB

This page was built for publication: Fifty-plus years of combinatorial integer programming

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