Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)

By Y. Pochet, Laurence A. Wolsey. 2006

267 citations recorded by the source corpus.

How researchers see this paper

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

Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches (2019, methodology): “ry node of the search tree. Mixed-Integer Programing is the most successful technique to optimally solve NP-Hard problems and has been applied to a large number of problems, from production planning (Pochet and Wolsey, 2006) to prediction of protein structures (Zhu, 2007). To the best of our knowled”
Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups (2010, background): “The reader is referred to Pochet and Wolsey (2006) for an introduction to integer programming formulations of lot-sizing problems.”
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, background): “In the third paper entitled Reformulation and Decomposition of Integer Programs, François Vanderbeck and Laurence Wolsey survey ways to reformulate integer and mixed integer programs to obtain stronger linear programming relaxations.”
qpOASES: a parametric active-set algorithm for quadratic programming (2014, methodology): “A detailed presentation of the update techniques implemented in our code qpOASES can be found in [14,26] and fundamentals for null-space updates can be found in [48].”
Mixed Integer Linear Programming Formulation Techniques (2015, unknown): “Unauthorized reproduction of this article is prohibited.”