| Approximate extended formulations MV Vyve, LA Wolsey Mathematical Programming 105 (2), 501-522, 2006 | 86 | 2006 |
| Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions M Madani, M Van Vyve European Journal of Operational Research 242 (2), 580-593, 2015 | 74 | 2015 |
| Linear prices for non-convex electricity markets: models and algorithms M Van Vyve CORE, 2011 | 73 | 2011 |
| Securely solving simple combinatorial graph problems A Aly, E Cuvelier, S Mawet, O Pereira, MV Vyve International Conference on Financial Cryptography and Data Security, 239-257, 2013 | 60 | 2013 |
| The continuous mixing polyhedron M Van Vyve Mathematics of Operations Research, 441-452, 2005 | 59 | 2005 |
| Algorithms for single-item lot-sizing problems with constant batch size M Van Vyve Mathematics of Operations Research 32 (3), 594-613, 2007 | 49* | 2007 |
| A general heuristic for production planning problems Y Pochet, M Van Vyve INFORMS Journal on Computing 16 (3), 316-327, 2004 | 49 | 2004 |
| A note on the extension complexity of the knapsack polytope S Pokutta, M Van Vyve Operations Research Letters 41 (4), 347-350, 2013 | 46 | 2013 |
| A MIP framework for non-convex uniform price day-ahead electricity auctions M Madani, M Van Vyve EURO Journal on Computational Optimization 5 (1), 263-284, 2017 | 41* | 2017 |
| Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity MV Vyve Mathematical Programming 108 (1), 53-77, 2006 | 37 | 2006 |
| Lot-sizing with fixed charges on stocks: the convex hull M Van Vyve, F Ortega Discrete Optimization 1 (2), 189-203, 2004 | 28 | 2004 |
| A solution approach of production planning problems based on compact formulations for single-item lot-sizing models M Van Vyve Quarterly Journal of the Belgian, French and Italian Operations Research …, 2004 | 24 | 2004 |
| Revisiting minimum profit conditions in uniform price day-ahead electricity auctions M Madani, M Van Vyve European Journal of Operational Research 266 (3), 1072-1085, 2018 | 23 | 2018 |
| Securely solving classical network flow problems A Aly, MV Vyve International Conference on Information Security and Cryptology, 205-221, 2014 | 23 | 2014 |
| Relaxations for two-level multi-item lot-sizing problems M Van Vyve, LA Wolsey, H Yaman Mathematical Programming 146 (1), 495-523, 2014 | 22 | 2014 |
| Mixing MIR inequalities with two divisible coefficients M Constantino, AJ Miller, M Van Vyve Mathematical Programming 123 (2), 451-483, 2010 | 17 | 2010 |
| An extended formulation of the convex recoloring problem on a tree S Chopra, B Filipecki, K Lee, M Ryu, S Shim, M Van Vyve Mathematical Programming 165 (2), 529-548, 2017 | 16 | 2017 |
| Solving integrated production and condition-based maintenance planning problems by MIP modeling F Shamsaei, M Van Vyve Flexible Services and Manufacturing Journal 29 (2), 184-202, 2017 | 16 | 2017 |
| Practically efficient secure single-commodity multi-market auctions A Aly, MV Vyve International Conference on Financial Cryptography and Data Security, 110-129, 2016 | 15 | 2016 |
| Convex hull, ip and european electricity pricing in a european power exchanges setting with efficient computation of convex hull prices M Madani, C Ruiz, S Siddiqui, M Van Vyve arXiv preprint arXiv:1804.00048, 2018 | 12 | 2018 |
Mehdi MadaniN-SIDEDirección de correo verificada de n-side.com
