Exact algorithms for the traveling salesman problem with draft limits
DOI10.1016/J.EJOR.2013.10.042zbMATH Open1305.90342OpenAlexW2001359388MaRDI QIDQ2256207FDOQ2256207
Authors: Maria Battarra, Artur Alves Pessoa, A. Subramanian, Eduardo Uchoa 
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.042
Recommendations
- The traveling salesman problem with draft limits
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping
- The traveling salesman problem: An overview of exact and approximate algorithms
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- Integer Programming Formulation of Traveling Salesman Problems
- Solution of a Large-Scale Traveling-Salesman Problem
- The time dependent traveling salesman problem: polyhedra and algorithm
- New route relaxation and pricing strategies for the vehicle routing problem
- The traveling salesman problem with draft limits
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- Title not available (Why is that?)
Cited In (8)
- The heterogeneous fleet vehicle routing problem with draft limits
- Cargo routing and scheduling problem in deep-sea transportation: case study from a fertilizer company
- Theory and application of reciprocal transformation of “path problem” and “time float problem”
- Exact and heuristic algorithms for the parallel machine total completion time scheduling problem with dual resources, ready times, and sequence-dependent setup times
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A branch-and-price approach to the feeder network design problem
- The traveling salesman problem with draft limits
- Tight lower bounds for the traveling salesman problem with draft limits
Uses Software
This page was built for publication: Exact algorithms for the traveling salesman problem with draft limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256207)
