| Publication | Date of Publication | Type |
|---|
Box-total dual integrality and edge-connectivity
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
The Schrijver system of the flow cone in series-parallel graphs
Discrete Applied Mathematics | 2022-01-05 | Paper |
Efficient formulations for the traveling car renter problem and its quota variant
Optimization Letters | 2021-08-19 | Paper |
| On \(k\)-edge-connected polyhedra: box-TDIness in series-parallel graphs | 2021-02-04 | Paper |
Trader multiflow and box-TDI systems in series-parallel graphs
Discrete Optimization | 2019-06-13 | Paper |
The vertex \(k\)-cut problem
Discrete Optimization | 2019-06-13 | Paper |
The \(st\)-bond polytope on series-parallel graphs
RAIRO - Operations Research | 2019-01-18 | Paper |
Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
Discrete Optimization | 2018-05-24 | Paper |
Circuit and bond polytopes on series-parallel graphs
Discrete Optimization | 2018-05-24 | Paper |
Lexicographical polytopes
Discrete Applied Mathematics | 2018-04-04 | Paper |
A set covering approach for the double traveling salesman problem with multiple stacks
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Robust location transportation problems under uncertain demands
Discrete Applied Mathematics | 2015-09-22 | Paper |
| On the complexity of the Eulerian closed walk with precedence path constraints problem | 2013-11-08 | Paper |
| Structural analysis for differential-algebraic systems: complexity, formulation and facets | 2013-11-08 | Paper |
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Polyhedral analysis and branch-and-cut for the structural analysis problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Tree based models and algorithms for the preemptive asymmetric stacker crane problem
RAIRO. Operations Research | 2012-09-04 | Paper |
Tree based models and algorithms for the preemptive asymmetric stacker crane problem
RAIRO. Operations Research | 2012-09-04 | Paper |
On the complexity of the Eulerian closed walk with precedence path constraints problem
Theoretical Computer Science | 2012-08-08 | Paper |
Models for the single-vehicle preemptive pickup and delivery problem
Journal of Combinatorial Optimization | 2012-05-23 | Paper |
On the NP-completeness of the perfect matching free subgraph problem
Theoretical Computer Science | 2012-05-14 | Paper |
Recourse problem of the 2-stage robust location transportation problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Tree based heuristics for the preemptive asymmetric stacker crane problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Contractions in perfect graph
(available as arXiv preprint) | N/A | Paper |
