| Publication | Date of Publication | Type |
|---|
The multiple Steiner TSP with order constraints: complexity and optimization algorithms
Soft Computing | 2022-07-21 | Paper |
A robust \(p\)-center problem under pressure to locate shelters in wildfire context
EURO Journal on Computational Optimization | 2020-08-26 | Paper |
Portfolio optimization with \(pw\)-robustness
EURO Journal on Computational Optimization | 2019-03-19 | Paper |
An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
Networks | 2018-06-13 | Paper |
Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
Networks | 2018-05-23 | Paper |
MIP formulations for a rich real-world lot-sizing problem with setup carryover
Lecture Notes in Computer Science | 2016-11-30 | Paper |
| Lower bounding techniques for DSATUR-based branch and bound | 2016-10-18 | Paper |
Web services composition: complexity and models
Discrete Applied Mathematics | 2015-09-30 | Paper |
Robust location transportation problems under uncertain demands
Discrete Applied Mathematics | 2015-09-22 | Paper |
Recent advances in robust optimization: an overview
European Journal of Operational Research | 2015-02-19 | Paper |
New models for the robust shortest path problem: complexity, resolution and generalization
Annals of Operations Research | 2013-09-16 | Paper |
Recourse problem of the 2-stage robust location transportation problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Multilayer survivable optical network design
Lecture Notes in Computer Science | 2011-09-09 | Paper |
| Robust shortest path problems | 2010-12-08 | Paper |
Robustness and duality in linear programming
The Journal of the Operational Research Society | 2010-09-24 | Paper |
Linear programming with interval right hand sides
International Transactions in Operational Research | 2010-06-08 | Paper |
Best and Worst Optimum for Linear Programs with Interval Right Hand Sides
Communications in Computer and Information Science | 2009-05-13 | Paper |
Strengthened 0-1 linear formulation for the daily satellite mission planning
Journal of Combinatorial Optimization | 2007-06-21 | Paper |
| scientific article; zbMATH DE number 2050786 (Why is no real title available?) | 2004-03-07 | Paper |
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
Operations Research Letters | 2003-04-03 | Paper |
Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
European Journal of Operational Research | 2002-05-28 | Paper |
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters | 2001-09-03 | Paper |
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
European Journal of Operational Research | 1999-01-19 | Paper |
LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
Acta Mathematica Vietnamica | 1998-04-13 | Paper |
A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts
Annals of Operations Research | 1997-08-24 | Paper |
Planification à moyen terme de la production d'un satellite défilant et ensembles stables
RAIRO - Operations Research | 1996-02-18 | Paper |
