Evolution and state-of-the-art in integer programming
type: Item
instance of: scholarly article
title: Evolution and state-of-the-art in integer programming
zbMATH Open document ID: 0966.90054
DOI: 10.1016/S0377-0427(00)00431-3
author: Hanif D. Sherali
author: Patrick J. Driscoll
published in: Journal of Computational and Applied Mathematics
publication date: 2001-08-14T00:00:00Z
review text: 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.
reviewed by: Matthias Ehrgott
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1556996
zbMATH Keywords: integer programming
zbMATH Keywords: survey
zbMATH Keywords: branch-and-bound
zbMATH Keywords: cutting planes
zbMATH Keywords: polyhedral theory
zbMATH Keywords: branch-and-cut
zbMATH Keywords: reformulation-linearization techniques
zbMATH Keywords: facial disjunctive programming
zbMATH Keywords: post-solution analysis
zbMATH Keywords: stochastic integer programming
zbMATH Keywords: meta-heuristics
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q3994799
cites work: Disjunctive programming: Properties of the convex hull of feasible points
cites work: Formulating a Mixed Integer Programming Problem to Improve Solvability
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Q4354785
cites work: Q4377042
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Q4040221
cites work: Two‐stage stochastic integer programming: a survey
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Q4398366
cites work: Q4054818
full work available at URL: s0377-0427(00)00431-3
OpenAlex ID: W2054942562
Recommended article: Progress in Academic Computational Integer Programming
Recommended article: Recent advances in integer programming
Recommended article: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
Recommended article: Integer programming as a framework for optimization and approximability
Recommended article: An Evolutionary Solver for Pure Integer Linear Programming
Recommended article: Q4340910
Recommended article: Developments in linear and integer programming
Recommended article: Theory and Applications of n-Fold Integer Programming
Recommended article: Q4841053
Recommended article: An evolutionary algorithm for polishing mixed integer programming solutions
description: scientific article; zbMATH DE number 1556996