Mathieu Van Vyve

30 papers B 1Misc 1Journal 24Unranked 3
YearRankTypeTitle / Venue / Authors
2022 J jnl
A sequential Stackelberg game for dynamic inspection problems.
Eur. J. Oper. Res.
Cristóbal Guzmán, Javiera Riffo, Claudio Telha, Mathieu Van Vyve
2020 J jnl
Stronger path-based extended formulation for the Steiner tree problem.
Networks
Bartosz Filipecki, Mathieu Van Vyve
2018 J jnl
On the on-line maintenance scheduling problem.
Optim. Lett.
Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve
2018 J jnl
Revisiting minimum profit conditions in uniform price day-ahead electricity auctions.
Eur. J. Oper. Res.
Mehdi Madani, Mathieu Van Vyve
2017 J jnl
A MIP framework for non-convex uniform price day-ahead electricity auctions.
EURO J. Comput. Optim.
Mehdi Madani, Mathieu Van Vyve
2017 J jnl
An extended formulation of the convex recoloring problem on a tree.
Math. Program.
Sunil Chopra, Bartosz Filipecki, Kangbok Lee, Minseok Ryu, Sangho Shim, Mathieu Van Vyve
2017 J jnl
Fixed-charge transportation problems on trees.
Oper. Res. Lett.
Gustavo Angulo, Mathieu Van Vyve
2017 J jnl
Practically Efficient Secure Single-Commodity Multi-Market Auctions.
IACR Cryptol. ePrint Arch.
Abdelrahaman Aly, Mathieu Van Vyve
2016 J jnl
Efficient approximation schemes for Economic Lot-Sizing in continuous time.
Discret. Optim.
Claudio Telha, Mathieu Van Vyve
2016 — conf
Practically Efficient Secure Single-Commodity Multi-market Auctions.
Financial Cryptography
Abdelrahaman Aly, Mathieu Van Vyve
2015 J jnl
Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions.
Eur. J. Oper. Res.
Mehdi Madani, Mathieu Van Vyve
2015 J jnl
Fixed-charge transportation problems on trees.
CoRR
Gustavo Angulo, Mathieu Van Vyve
2014 J jnl
Relaxations for two-level multi-item lot-sizing problems.
Math. Program.
Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman
2014 Misc conf
Securely Solving Classical Network Flow Problems.
ICISC
Abdelrahaman Aly, Mathieu Van Vyve
2013 J jnl
A note on the extension complexity of the knapsack polytope.
Oper. Res. Lett.
Sebastian Pokutta, Mathieu Van Vyve
2013 J jnl
Fixed-charge transportation on a path: optimization, LP formulations and separation.
Math. Program.
Mathieu Van Vyve
2013 — conf
Securely Solving Simple Combinatorial Graph Problems.
Financial Cryptography
Abdelrahaman Aly, Edouard Cuvelier, Sophie Mawet, Olivier Pereira, Mathieu Van Vyve
2013 J jnl
Strong and compact relaxations in the original space using a compact extended formulation.
EURO J. Comput. Optim.
Mathieu Van Vyve, Laurence A. Wolsey
2012 J jnl
A heuristic method to schedule training programs for Small and Medium Enterprises.
Eur. J. Oper. Res.
Mahmood Rezaei, Fahimeh Shamsaei, Iman Mohammadian, Mathieu Van Vyve
2011 B conf
Fixed-Charge Transportation on a Path: Linear Programming Formulations.
IPCO
Mathieu Van Vyve
2010 J jnl
Mixing MIR inequalities with two divisible coefficients.
Math. Program.
Miguel Constantino, Andrew J. Miller, Mathieu Van Vyve
2008 — conf
LS-LIB: A Library of Tools for Solving Production Planning Problems.
Bonn Workshop of Combinatorial Optimization
Yves Pochet, Mathieu Van Vyve
2007 J jnl
Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size.
Math. Oper. Res.
Mathieu Van Vyve
2006 J jnl
Approximate extended formulations.
Math. Program.
Mathieu Van Vyve, Laurence A. Wolsey
2006 J jnl
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity.
Math. Program.
Mathieu Van Vyve
2005 J jnl
The Continuous Mixing Polyhedron.
Math. Oper. Res.
Mathieu Van Vyve
2004 J jnl
A General Heuristic for Production Planning Problems.
INFORMS J. Comput.
Yves Pochet, Mathieu Van Vyve
2004 J jnl
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models.
4OR
Mathieu Van Vyve
2004 J jnl
Lot-sizing with fixed charges on stocks: the convex hull.
Discret. Optim.
Mathieu Van Vyve, Francisco Ortega
2003 — —
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models.
Mathieu Van Vyve