A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. - Mathieu Van Vyve (2003)

A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. - Mathieu Van Vyve (4OR, 2004)

Lot-sizing with fixed charges on stocks: the convex hull. - Mathieu Van Vyve; Francisco Ortega (Discret. Optim., 2004)

A General Heuristic for Production Planning Problems. - Yves Pochet; Mathieu Van Vyve (INFORMS J. Comput., 2004)

The Continuous Mixing Polyhedron. - Mathieu Van Vyve (Math. Oper. Res., 2005)

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. - Mathieu Van Vyve (Math. Program., 2006)

Approximate extended formulations. - Mathieu Van Vyve; Laurence A. Wolsey (Math. Program., 2006)

Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size. - Mathieu Van Vyve (Math. Oper. Res., 2007)

LS-LIB: A Library of Tools for Solving Production Planning Problems. - Yves Pochet; Mathieu Van Vyve (Bonn Workshop of Combinatorial Optimization, 2008)

Mixing MIR inequalities with two divisible coefficients. - Miguel Constantino; Andrew J. Miller; Mathieu Van Vyve (Math. Program., 2010)

Fixed-Charge Transportation on a Path: Linear Programming Formulations. - Mathieu Van Vyve (IPCO, 2011)

A heuristic method to schedule training programs for Small and Medium Enterprises. - Mahmood Rezaei; Fahimeh Shamsaei; Iman Mohammadian; Mathieu Van Vyve (Eur. J. Oper. Res., 2012)

Securely Solving Simple Combinatorial Graph Problems. - Abdelrahaman Aly; Edouard Cuvelier; Sophie Mawet; Olivier Pereira; Mathieu Van Vyve (Financial Cryptography, 2013)

Strong and compact relaxations in the original space using a compact extended formulation. - Mathieu Van Vyve; Laurence A. Wolsey (EURO J. Comput. Optim., 2013)

Fixed-charge transportation on a path: optimization, LP formulations and separation. - Mathieu Van Vyve (Math. Program., 2013)

A note on the extension complexity of the knapsack polytope. - Sebastian Pokutta; Mathieu Van Vyve (Oper. Res. Lett., 2013)

Securely Solving Classical Network Flow Problems. - Abdelrahaman Aly; Mathieu Van Vyve (ICISC, 2014)

Relaxations for two-level multi-item lot-sizing problems. - Mathieu Van Vyve; Laurence A. Wolsey; Hande Yaman (Math. Program., 2014)

Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions. - Mehdi Madani; Mathieu Van Vyve (Eur. J. Oper. Res., 2015)

Efficient approximation schemes for Economic Lot-Sizing in continuous time. - Claudio Telha; Mathieu Van Vyve (Discret. Optim., 2016)

A MIP framework for non-convex uniform price day-ahead electricity auctions. - Mehdi Madani; Mathieu Van Vyve (EURO J. Comput. Optim., 2017)

Practically Efficient Secure Single-Commodity Multi-Market Auctions. - Abdelrahaman Aly; Mathieu Van Vyve (IACR Cryptol. ePrint Arch., 2017)

An extended formulation of the convex recoloring problem on a tree. - Sunil Chopra; Bartosz Filipecki; Kangbok Lee; Minseok Ryu; Sangho Shim; Mathieu Van Vyve (Math. Program., 2017)

Fixed-charge transportation problems on trees. - Gustavo Angulo; Mathieu Van Vyve (Oper. Res. Lett., 2017)

Revisiting minimum profit conditions in uniform price day-ahead electricity auctions. - Mehdi Madani; Mathieu Van Vyve (Eur. J. Oper. Res., 2018)

On the on-line maintenance scheduling problem. - Fahimeh Shamsaei; Claudio Telha; Mathieu Van Vyve (Optim. Lett., 2018)

Stronger path-based extended formulation for the Steiner tree problem. - Bartosz Filipecki; Mathieu Van Vyve (Networks, 2020)

A sequential Stackelberg game for dynamic inspection problems. - Cristóbal Guzmán; Javiera Riffo; Claudio Telha; Mathieu Van Vyve (Eur. J. Oper. Res., 2022)