Fifty-Plus Years of Combinatorial Integer Programming
From MaRDI portal
Publication:3565241
DOI10.1007/978-3-540-68279-0_12zbMath1187.90008OpenAlexW173607290MaRDI QIDQ3565241
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
Integer programming (90C10) Combinatorial optimization (90C27) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)
Related Items
The Boolean Quadric Polytope, A polyhedral approach to the single row facility layout problem, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Gap inequalities for non-convex mixed-integer quadratic programs, Complexity results for the gap inequalities for the max-cut problem, New valid inequalities for the fixed-charge and single-node flow polytopes, Mixed Integer Linear Programming Formulation Techniques, On the complexity of surrogate and group relaxation for integer linear programs, Graphs and Algorithms in Communication Networks on Seven League Boots, A new separation algorithm for the Boolean quadric and cut polytopes
Uses Software