| Publication | Date of Publication | Type |
|---|
Complexity of the virtual network embedding with uniform demands
Annals of Operations Research | 2026-03-30 | Paper |
The Anchor-Robust Project Scheduling Problem
Operations Research | 2024-03-15 | Paper |
Dominance inequalities for scheduling around an unrestrictive common due date
European Journal of Operational Research | 2021-11-09 | Paper |
Dominance-based linear formulation for the anchor-robust project scheduling problem
European Journal of Operational Research | 2021-11-05 | Paper |
Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
| Anchored rescheduling problems under generalized precedence constraints | 2021-02-04 | Paper |
Mixed integer formulations using natural variables for single machine scheduling around a common due date
Discrete Applied Mathematics | 2021-01-13 | Paper |
Symmetry-breaking inequalities for ILP with structured sub-symmetry
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| Sub-symmetry-breaking inequalities for ILP with structured symmetry | 2020-02-06 | Paper |
On the complexity of the unit commitment problem
Annals of Operations Research | 2019-03-06 | Paper |
The min-up/min-down unit commitment polytope
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Branch-and-cut-and-price algorithms for the preemptive RCPSP
RAIRO - Operations Research | 2018-11-01 | Paper |
The unit-capacity constrained permutation problem
European Journal of Operational Research | 2018-05-30 | Paper |
Anchored reactive and proactive solutions to the CPM-scheduling problem
European Journal of Operational Research | 2018-05-29 | Paper |
Circuit and bond polytopes on series-parallel graphs
Discrete Optimization | 2018-05-24 | Paper |
Feasibility recovery for the unit-capacity constrained permutation problem
Discrete Optimization | 2018-05-24 | Paper |
Valid inequalities for the synchronization bus timetabling problem
European Journal of Operational Research | 2016-10-07 | Paper |
The location-dispatching problem: polyhedral results and content delivery network design
Discrete Applied Mathematics | 2015-09-22 | Paper |
A branch-and-cut for the Non-Disjointm-Ring-Star Problem
RAIRO - Operations Research | 2014-05-26 | Paper |
| The location-dispatching problem: polyhedral results and content delivery network design | 2013-11-08 | Paper |
The non-disjoint \(m\)-ring-star problem: polyhedral results and SDH/SONET network design
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Solving VLSI design and DNA sequencing problems using bipartization of graphs
Computational Optimization and Applications | 2012-06-19 | Paper |
Survivability in hierarchical telecommunications networks
Networks | 2012-06-18 | Paper |
Generating facets for the independence system polytope
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Polyhedral results for the bipartite induced subgraph problem
Discrete Applied Mathematics | 2006-10-30 | Paper |
Contractions in perfect graph
(available as arXiv preprint) | N/A | Paper |
