default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathieu Van Vyve
Person information
- affiliation: Université libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j22]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): 727-739 (2022)- 2020
- [j21]Bartosz Filipecki, Mathieu Van Vyve:
Stronger path-based extended formulation for the Steiner tree problem. Networks 75(1): 3-17 (2020)
2010 – 2019
- 2018
- [j20]Mehdi Madani, Mathieu Van Vyve:
Revisiting minimum profit conditions in uniform price day-ahead electricity auctions. Eur. J. Oper. Res. 266(3): 1072-1085 (2018) - [j19]Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve:
On the on-line maintenance scheduling problem. Optim. Lett. 12(2): 387-397 (2018) - 2017
- [j18]Mehdi Madani, Mathieu Van Vyve:
A MIP framework for non-convex uniform price day-ahead electricity auctions. EURO J. Comput. Optim. 5(1-2): 263-284 (2017) - [j17]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): 529-548 (2017) - [j16]Gustavo Angulo, Mathieu Van Vyve:
Fixed-charge transportation problems on trees. Oper. Res. Lett. 45(3): 275-281 (2017) - [i2]Abdelrahaman Aly, Mathieu Van Vyve:
Practically Efficient Secure Single-Commodity Multi-Market Auctions. IACR Cryptol. ePrint Arch. 2017: 439 (2017) - 2016
- [j15]Claudio Telha, Mathieu Van Vyve:
Efficient approximation schemes for Economic Lot-Sizing in continuous time. Discret. Optim. 20: 23-39 (2016) - [c5]Abdelrahaman Aly, Mathieu Van Vyve:
Practically Efficient Secure Single-Commodity Multi-market Auctions. Financial Cryptography 2016: 110-129 - 2015
- [j14]Mehdi Madani, Mathieu Van Vyve:
Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions. Eur. J. Oper. Res. 242(2): 580-593 (2015) - [i1]Gustavo Angulo, Mathieu Van Vyve:
Fixed-charge transportation problems on trees. CoRR abs/1511.08179 (2015) - 2014
- [j13]Mathieu Van Vyve, Laurence A. Wolsey, Hande Yaman:
Relaxations for two-level multi-item lot-sizing problems. Math. Program. 146(1-2): 495-523 (2014) - [c4]Abdelrahaman Aly, Mathieu Van Vyve:
Securely Solving Classical Network Flow Problems. ICISC 2014: 205-221 - 2013
- [j12]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): 71-80 (2013) - [j11]Mathieu Van Vyve:
Fixed-charge transportation on a path: optimization, LP formulations and separation. Math. Program. 142(1-2): 371-395 (2013) - [j10]Sebastian Pokutta, Mathieu Van Vyve:
A note on the extension complexity of the knapsack polytope. Oper. Res. Lett. 41(4): 347-350 (2013) - [c3]Abdelrahaman Aly, Edouard Cuvelier, Sophie Mawet, Olivier Pereira, Mathieu Van Vyve:
Securely Solving Simple Combinatorial Graph Problems. Financial Cryptography 2013: 239-257 - 2012
- [j9]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): 600-608 (2012) - 2011
- [c2]Mathieu Van Vyve:
Fixed-Charge Transportation on a Path: Linear Programming Formulations. IPCO 2011: 417-429 - 2010
- [j8]Miguel Constantino, Andrew J. Miller, Mathieu Van Vyve:
Mixing MIR inequalities with two divisible coefficients. Math. Program. 123(2): 451-483 (2010)
2000 – 2009
- 2008
- [c1]Yves Pochet, Mathieu Van Vyve:
LS-LIB: A Library of Tools for Solving Production Planning Problems. Bonn Workshop of Combinatorial Optimization 2008: 317-346 - 2007
- [j7]Mathieu Van Vyve:
Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size. Math. Oper. Res. 32(3): 594-613 (2007) - 2006
- [j6]Mathieu Van Vyve, Laurence A. Wolsey:
Approximate extended formulations. Math. Program. 105(2-3): 501-522 (2006) - [j5]Mathieu Van Vyve:
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math. Program. 108(1): 53-77 (2006) - 2005
- [j4]Mathieu Van Vyve:
The Continuous Mixing Polyhedron. Math. Oper. Res. 30(2): 441-452 (2005) - 2004
- [j3]Mathieu Van Vyve:
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. 4OR 2(1): 89-91 (2004) - [j2]Mathieu Van Vyve, Francisco Ortega:
Lot-sizing with fixed charges on stocks: the convex hull. Discret. Optim. 1(2): 189-203 (2004) - [j1]Yves Pochet, Mathieu Van Vyve:
A General Heuristic for Production Planning Problems. INFORMS J. Comput. 16(3): 316-327 (2004) - 2003
- [b1]Mathieu Van Vyve:
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2003
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
