• Corpus ID: 7478597

A Brief History of Linear and Mixed-Integer Programming Computation

@inproceedings{Bixby2012ABH,
  title={A Brief History of Linear and Mixed-Integer Programming Computation},
  author={Robert E. Bixby},
  year={2012}
}
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. However, it must be said that many other scientists have also made seminal contributions to the subject, and some would argue that the origins of LP predate Dantzig’s contribution. It is matter open to debate [36]. However, what is not open to debate is Dantzig’s key contribution to LP computation. In contrast to the economists of his time, Dantzig viewed LP not just as a qualitative tool in the… 
Accelerating the simplex algorithm via novel crash procedures
TLDR
It is shown that a novel initialization strategy provides a means of considerable speed up of the simplex algorithm.
On the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming
TLDR
An algorithm for MILPs with indicator constraints that incorporates elements of CP into MIP techniques, including computational results for the JobShopScheduling problem and an extension of the class of MILPs so that linear expressions are allowed to have non-contiguous domains.
Duality and a Closer Look at Implementation of Linear Optimization Algorithms
TLDR
This thesis reviews the history of LO and various software to solve LO problems, and explores duality, the role of duality LO software development, and the techniques used to dualize the standard LO optimization problems in the NETLIB set.
Decomposition Branching for Mixed Integer Programming
Applications of mixed integer programming can be found in many industries, such as transportation, healthcare, energy, and finance, and their economic impact is significant. It is also well known
A Survey of Linear and Mixed-Integer Optimization Tutorials
TLDR
This survey paper provides references to papers and reports whose purpose is to give overviews of linear and mixed-integer optimization and includes seminal texts and journal articles on fundamental topics, and furnish references on applications whose implementation may have implications for more general problems with similar mathematical structure.
Mixed-integer optimal control of fast dynamical systems
TLDR
OSQP is developed, a new robust and efficient general-purpose QP solver based on the alternating direction method of multipliers (ADMM) and able, for the first time, to detect infeasible problems.
Mixed Integer Programming: Analyzing 12 Years of Progress
TLDR
Back in 2001, Bixby et al. provided an analysis of the performance impact of the main mixed integer programming features and improvements up to CPLEX 8.0 for a workshop in honor of Manfred Padberg’s 60th birthday, which was later published in a Festschrift edited by Martin Grotschel.
Outer approximation for integer nonlinear programs via decision diagrams
TLDR
This work develops linear programming and subgradient-type methods to generate valid inequalities for the convex hull of the feasible region described byDDs and introduces IP techniques that can be derived from DDs and used in conjunction with IP to enhance the overall performance.
Two dimensional search algorithms for linear programming
TLDR
This dissertation proposes novel algorithms that move between solutions by repeatedly solving a two dimensional subspace linear program and presents a novel technique, called the ratio algorithm, to find an optimal basis and an optimal solution to linear programs with only two constraints.
A friendly smoothed analysis of the simplex method
TLDR
An improved and simpler analysis of shadow simplex methods, where the main algorithm requires an expected O(d2 √logn σ−2 + d5 log3/2 n) number of simplex pivots, and an improved shadow bound is obtained.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
TLDR
An attempt to provide a powerful mathematical programming language, allowing an easy programming of specific studies on medium-size models such as the recursive use of LP or the build-up of algorithms based on the simplex method is described.
Solving Large-Scale Zero-One Linear Programming Problems
TLDR
The results indicate that cutting-planes related to the facets of the underlying polytope are an indispensable tool for the exact solution of this class of problem.
Practical Solution of Large Mixed Integer Programming Problems with Umpire
In this paper we discuss some branch and bound methods implemented in the UMPIRE mathematical programming system for solving practical integer programming problems and give details of computational
Solving Real-World Linear Programs: A Decade and More of Progress
TLDR
One person's perspective on the development of computational tools for linear programming is described, followed by historical remarks covering the some 40 years of linear-programming developments that predate my own involvement in this subject.
Markowitz and Manne + Eastman + Land and Doig = Branch and Bound
The branch-and-bound method consists of the repeated application of a process for splitting a space of solutions into two or more subspaces and adopting a bounding mechanism to indicate if it is
An Automatic Method for Solving Discrete Programming Problems
In the late 1950s there was a group of teachers and research assistants at the London School of Economics interested in linear programming and its extensions, in particular Helen Makower, George
Experiments in mixed-integer linear programming
TLDR
The heuristic rules for generating the tree, which are the main features of the method, are presented and numerous parameters allow the user for adjusting the search strategy to a given problem.
SCIP: solving constraint integer programs
TLDR
An overview of the main design concepts of SCIP and how it can be used to solve constraint integer programs is given and experimental results show that the approach outperforms current state-of-the-art techniques for proving the validity of properties on circuits containing arithmetic.
A new polynomial-time algorithm for linear programming
TLDR
It is proved that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property: the ratio of the radius of the smallest sphere with center a′, containingP′ to theradius of the largest sphere withCenter a′ contained inP′ isO(n).
Solving Mixed Integer Programming Problems Using Automatic Reformulation
TLDR
The solution to optimality of 18 medium-to large-size problems, including production planning problems with setup costs and capacity constraints, multilevel distribution planning problems, drainage and heating system design problems, and electricity generator scheduling problems is reported on.
...
1
2
3
4
5
...