An exact algorithm for IP column generation

By F. Vanderbeck, Laurence A. Wolsey. 1994

How researchers see this paper

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

Citations in the corpus

Boolean Decision Rules via Column Generation (2018, background): “This bound is due to the fact that ck 2 for any clause and there might be at most C/2 missing variables with reduced cost no less than zCG that can be added to the Restricted MLP [48].”
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, background): “This group included Harold Kuhn and Martin (E. M. L.) Beale.”
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (2004, background): “Bounds based on the optimal objective value of the current restricted LP master problem and the objective values of the pricing problems appear in Lasdon [24], Farley [14], and Vanderbeck and Wolsey [41].”
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm (2000, methodology): “As branching takes a simpler form when the columns are binary vectors (Vanderbeck and Wolsey 1996), it is worth considering a scheme where the column generation subproblem is reformulated as a binary integer program and branching is based on subsets Q̂ that are de#ned in terms of the components of…”
Order batching to minimize total travel time in a parallel-aisle warehouse (2005, methodology): “…that Lagrangean relaxation can sometimes complement column generation very well in that it can be used in any iteration of the column generation method to compute a lower bound in only a little additional time; see for instance Vanderbeck and Wolsey (1996) and Van den Akker et al. (2000, 2002).”