Evolution and state-of-the-art in integer programming
branch-and-boundbranch-and-cutcutting planesfacial disjunctive programminginteger programmingmeta-heuristicspolyhedral theorypost-solution analysisreformulation-linearization techniquesstochastic integer programmingsurvey
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Stochastic programming (90C15) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Under a guideline of exploitation of structure present in integer programming problems this paper traces the evolution of integer programming methodology from the beginnings to the current state of the art. This thread leads from branch-and-bound, cutting planes, and polyhedral theory to branch-and-cut algorithms. Other topics covered are reformulation-linearization techniques, facial disjunctive programming, post-solution analysis, stochastic integer programming, and meta-heuristics.
- Progress in Academic computational integer programming
- Recent advances in integer programming
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Integer programming as a framework for optimization and approximability
- An Evolutionary Solver for Pure Integer Linear Programming
- scientific article; zbMATH DE number 1021641
- Developments in linear and integer programming
- Theory and Applications of n-Fold Integer Programming
- scientific article; zbMATH DE number 781263
- An evolutionary algorithm for polishing mixed integer programming solutions
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Branch-and-price: Column generation for solving huge integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- scientific article; zbMATH DE number 1175949 (Why is no real title available?)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Solving Large-Scale Zero-One Linear Programming Problems
- Two‐stage stochastic integer programming: a survey
- A linearization framework for unconstrained quadratic (0-1) problems
- An improved partial enumeration algorithm for integer programming problems
- Heuristics for the 0-1 multidimensional knapsack problem
- General purpose heuristics for integer programming. I
- Computing the minimum construction cost of a building's external wall taking into account its energy efficiency
- Mixed integer programming for a special logic constrained optimal control problem
- Future paths for integer programming and links to artificial intelligence
- An evolutionary algorithm for polishing mixed integer programming solutions
- Fifty-plus years of combinatorial integer programming
- Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A partial enumeration algorithm for pure nonlinear integer programming
- A method to improve integer linear programming problem with branch-and-bound procedure
This page was built for publication: Evolution and state-of-the-art in integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593833)
