Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming

DOI10.1080/03155986.1994.11732235zbMath0807.90095OpenAlexW436551700MaRDI QIDQ4294336

Salvatore Ricciardelli, Aristide Mingozzi, Massimo Spadoni, Lucio Bianco

Publication date: 24 May 1994

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732235

zbMATH Keywords

dial-a-ridestate space relaxationbounding proceduretraveling salesman problem with precedence constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ Routing problems: A bibliography ⋮ The pickup and delivery problem: Faces and branch-and-cut algorithm ⋮ Constrained TSP and low-power computing ⋮ An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows ⋮ Matheuristics: survey and synthesis ⋮ The travelling salesman problem with precedence constraints. ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ The multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

This page was built for publication: Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming