Mathieu Van Vyve

Publication Activity (10 Years)

Years Active: 2004-2022
Publications (10 Years): 10

Top Topics

Single Commodity

Transportation Problem

Integer Programming

Top Venues

Eur. J. Oper. Res.

Oper. Res. Lett.

Financial Cryptography

Publications

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