| Publication | Date of Publication | Type |
|---|
Vehicle routing problem with time windows -- new valid inequalities from polar duality
Networks | 2026-01-06 | Paper |
Fiber-to-the-home passive optical distribution network design: a new formulation and valid inequalities using polar duality
Networks | 2025-06-13 | Paper |
Set convergences via bornology
Set-Valued and Variational Analysis | 2025-02-28 | Paper |
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines
Networks | 2024-05-17 | Paper |
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
Networks | 2023-12-11 | Paper |
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
Networks | 2023-12-11 | Paper |
Train stop scheduling problem: an exact approach using valid inequalities and polar duality
European Journal of Operational Research | 2023-11-15 | Paper |
Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
European Journal of Operational Research | 2022-02-23 | Paper |
New valid inequalities for the optimal communication spanning tree problem
INFORMS Journal on Computing | 2020-12-03 | Paper |
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Operations Research Letters | 2020-02-11 | Paper |
Network loading problem: valid inequalities from 5- and higher partitions
Computers & Operations Research | 2018-08-08 | Paper |
Solving the two‐facility network design problem with 3‐partition facets
Networks | 2018-05-23 | Paper |
Fixed charge multicommodity network design using p-partition facets
European Journal of Operational Research | 2018-02-16 | Paper |
Near optimal design of wavelength routed optical networks
European Journal of Operational Research | 2016-10-07 | Paper |
Optimal relay node placement in delay constrained wireless sensor network design
European Journal of Operational Research | 2016-06-24 | Paper |
Survivable network design with shared-protection routing
European Journal of Operational Research | 2016-06-23 | Paper |
Design of survivable networks using three- and four-partition facets
Operations Research | 2013-07-02 | Paper |
Fixed-charge transportation problem: facets of the projection polyhedron
Operations Research | 2012-11-08 | Paper |
A polyhedral approach for solving two facility network design problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Polyhedral structure of the 4-node network design problem
Networks | 2010-11-24 | Paper |
| Benders' partitioning approach for solving the optimal communication spanning tree problem | 2009-11-27 | Paper |
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research | 2009-07-03 | Paper |
k-Partition-based facets of the network design problem
Networks | 2006-06-06 | Paper |
A set‐partitioning‐based exact algorithm for the vehicle routing problem
Networks | 1989-01-01 | Paper |
