| Publication | Date of Publication | Type |
|---|
A polyhedral study of a relaxation of the routing and spectrum allocation problem (brief announcement)
Procedia Computer Science | 2025-12-11 | Paper |
Connected subgraphs, matching, and partitions
Discrete Mathematics, Algorithms and Applications | 2025-11-12 | Paper |
| A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties | 2025-10-31 | Paper |
On non-superperfection of edge intersection graphs of paths
Discrete Optimization | 2025-01-23 | Paper |
Solving the routing and spectrum assignment problem, driven by combinatorial properties
Networks | 2024-03-15 | Paper |
Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
European Journal of Operational Research | 2023-07-11 | Paper |
Bounded-degree rooted tree and TDI-Ness
RAIRO - Operations Research | 2022-09-15 | Paper |
The complexity of the unit stop number problem and its implications to other related problems
Theoretical Computer Science | 2022-05-10 | Paper |
| On superperfection of edge intersection graphs of paths | 2021-12-08 | Paper |
A computational study on the maximum-weight bounded-degree rooted tree problem
Applied Mathematics and Computation | 2021-11-16 | Paper |
Robust multiobjective optimization with application to Internet routing
Annals of Operations Research | 2019-03-06 | Paper |
| The stop number minimization problem: complexity and polyhedral analysis | 2018-08-17 | Paper |
Minimal arc-sets spanning dicycles
Discrete Applied Mathematics | 2018-04-04 | Paper |
Polyhedral study of the connected subgraph problem
Discrete Mathematics | 2014-11-07 | Paper |
| On the complexity of the Eulerian closed walk with precedence path constraints problem | 2013-11-08 | 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 |
Tree based heuristics for the preemptive asymmetric stacker crane problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A branch-and-cut algorithm for a resource-constrained scheduling problem
RAIRO - Operations Research | 2011-06-01 | Paper |
A branch-and-cut algorithm for a resource-constrained scheduling problem
RAIRO - Operations Research | 2011-06-01 | Paper |
On the Polytope of the (1,2)-Survivable Network Design Problem
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Routing of uncertain traffic demands
Optimization and Engineering | 2009-08-12 | Paper |
On a resource-constrained scheduling problem with application to distributed systems reconfiguration
European Journal of Operational Research | 2007-07-04 | Paper |
Design of Survivable Networks: A survey
Networks | 2005-09-22 | Paper |
| scientific article; zbMATH DE number 2196281 (Why is no real title available?) | 2005-08-22 | Paper |
Separation of partition inequalities with terminals
Discrete Optimization | 2005-08-22 | Paper |
On survivable network polyhedra
Discrete Mathematics | 2005-04-18 | Paper |
Separation of partition inequalities for the \((1,2)\)-survivable network design problem
Operations Research Letters | 2003-04-03 | Paper |
Steiner trees and polyhedra
Discrete Applied Mathematics | 2002-07-30 | Paper |
