| Publication | Date of Publication | Type |
|---|
Stronger path‐based extended formulation for the Steiner tree problem
Networks | 2023-11-13 | Paper |
A sequential Stackelberg game for dynamic inspection problems
European Journal of Operational Research | 2022-06-08 | Paper |
Practically efficient secure single-commodity multi-market auctions
Financial Cryptography and Data Security | 2021-04-07 | Paper |
Fixed-charge transportation problems on trees
Operations Research Letters | 2019-02-22 | Paper |
Revisiting minimum profit conditions in uniform price day-ahead electricity auctions
European Journal of Operational Research | 2018-05-30 | Paper |
Efficient approximation schemes for economic lot-sizing in continuous time
Discrete Optimization | 2018-05-24 | Paper |
On the on-line maintenance scheduling problem
Optimization Letters | 2018-04-19 | Paper |
| Convex Hull, IP and European Electricity Pricing in a European Power Exchanges setting with efficient computation of Convex Hull Prices | 2018-03-30 | Paper |
An extended formulation of the convex recoloring problem on a tree
Mathematical Programming. Series A. Series B | 2017-10-27 | Paper |
A MIP framework for non-convex uniform price day-ahead electricity auctions
EURO Journal on Computational Optimization | 2017-05-23 | Paper |
LS-LIB: a library of tools for solving production planning problems
Research Trends in Combinatorial Optimization | 2017-04-07 | Paper |
Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
European Journal of Operational Research | 2016-07-25 | Paper |
Securely solving classical network flow problems
Information Security and Cryptology - ICISC 2014 | 2015-09-11 | Paper |
Strong and compact relaxations in the original space using a compact extended formulation
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Relaxations for two-level multi-item lot-sizing problems
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
A note on the extension complexity of the knapsack polytope
Operations Research Letters | 2014-05-14 | Paper |
Fixed-charge transportation on a path: optimization, LP formulations and separation
Mathematical Programming. Series A. Series B | 2014-02-03 | Paper |
A heuristic method to schedule training programs for small and medium enterprises
European Journal of Operational Research | 2012-08-16 | Paper |
A general heuristic for production planning problems
INFORMS Journal on Computing | 2012-06-08 | Paper |
Fixed-charge transportation on a path: linear programming formulations
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Mixing MIR inequalities with two divisible coefficients
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
Mathematics of Operations Research | 2008-05-27 | Paper |
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
Approximate extended formulations
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
The Continuous Mixing Polyhedron
Mathematics of Operations Research | 2005-11-11 | Paper |
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
4OR | 2004-09-22 | Paper |
