Evolution and state-of-the-art in integer programming

DOI10.1016/S0377-0427(00)00431-3zbMath0966.90054OpenAlexW2054942562MaRDI QIDQ1593833

Hanif D. Sherali, Patrick J. Driscoll

Publication date: 14 August 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00431-3

zbMATH Keywords

surveyinteger programmingbranch-and-boundstochastic integer programmingcutting planesmeta-heuristicsbranch-and-cutpolyhedral theoryfacial disjunctive programmingpost-solution analysisreformulation-linearization techniques

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A partial enumeration algorithm for pure nonlinear integer programming, A method to improve integer linear programming problem with branch-and-bound procedure, Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP), A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, 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, 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

Uses Software

• Tabu search

Cites Work

• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Disjunctive programming: Properties of the convex hull of feasible points
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Solving Large-Scale Zero-One Linear Programming Problems
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Formulating a Mixed Integer Programming Problem to Improve Solvability
• Two‐stage stochastic integer programming: a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item