Mixed-Integer Programming: A Progress Report

By Robert E. Bixby, M. Fenelon, Zonghao Gu, Edward E. Rothberg, Roland Wunderling. 2004

124 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

Methods and Models for Interpretable Linear Classification (2014, methodology): “Recent progress in commercial MIP software has made it possible to solve exponentially larger problems [13, 12], and ushered in new MIP classification models that involve feature selection [42, 45, 46, 84], or the creation of a reserved-judgement region [22, 21].”
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (2003, methodology): “minimize P T2T (x (T; V T ) 3) subject to T S [ B; T1 6 T2 whenever T1; T2 2 T ; jT j 1 mod 2: (11)”
Integer-Programming Software Systems (2005, background): “The behavior of the branch–and–bound algorithm can be altered significantly by changing the parameter settings that control these components.”
Multiphase Mixed-Integer Optimal Control Approach to Aircraft Trajectory Optimization (2013, background): “Branch-and-bound is a standard algorithm for integer programming (see, for example, [26] and references therein).”
Mixed Integer Linear Programming Formulation Techniques (2015, background): “We now have several extremely effective state of the art solvers [4, 5, 6, 7] that incorporate many advanced techniques [8, 9, 10, 11, 12] and, since its early stages, MILP has been used to model a wide range of applications [13, 14].”
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem (2013, background): “In fact, exploring few nodes for long periods is an indication of the difficulty of the linear relaxed formulation [30].”