Facets and valid inequalities for the time-dependent travelling salesman problem

DOI10.1016/j.ejor.2013.05.022zbMath1304.90174OpenAlexW1969413967MaRDI QIDQ2514741

Paula Zabala, Juan José Miranda-Bront, Isabel Méndez-Díaz

Publication date: 3 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.05.022

zbMATH Keywords

integer programmingcombinatorial optimizationbranch and cuttime-dependent TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (7)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ Solving the traveling delivery person problem with limited computational time

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A new formulation for the traveling deliveryman problem
• On the dimension of projected polyhedra
• Scheduling in a sequence dependent setup environment with genetic search
• A classification of formulations for the (time-dependent) traveling salesman problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• The traveling salesman problem and its variations
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Delivery Man Problem and Cumulative Matroids
• Time‐dependent traveling salesman problem–the deliveryman case
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

This page was built for publication: Facets and valid inequalities for the time-dependent travelling salesman problem