Tight lower bounds for the traveling salesman problem with draft limits
From MaRDI portal
Publication:6109566
DOI10.1016/j.cor.2023.106196OpenAlexW4322743490MaRDI QIDQ6109566
Mehdi Mrad, Ali Balma, Talel Ladhari
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106196
traveling salesmanreformulation-linearization techniquemulti-commodity flowtime-dependent modeldraft limits
Cites Work
- Unnamed Item
- Optimization models for a single-plant district cooling system
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
- A two-level location-allocation problem in designing local access fiber optic networks
- Natural and extended formulations for the time-dependent traveling salesman problem
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- An analytical comparison of different formulations of the travelling salesman problem
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- The traveling salesman problem with draft limits
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- The time dependent traveling salesman problem: polyhedra and algorithm
- Exact algorithms for the traveling salesman problem with draft limits
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A New Formulation for the Travelling Salesman Problem
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Solution of a Large-Scale Traveling-Salesman Problem
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
This page was built for publication: Tight lower bounds for the traveling salesman problem with draft limits
