A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
From MaRDI portal
Publication:1588841
DOI10.1023/A:1008779125567zbMath1017.90095OpenAlexW2137045485MaRDI QIDQ1588841
Michael Jünger, Gerhard Reinelt, Norbert Ascheuer
Publication date: 26 August 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008779125567
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)
Related Items (27)
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ A sequential ordering problem in automotive paint shops ⋮ New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints ⋮ Comparison of Tabu/2-opt heuristic and optimal tree search method for assignment problems ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm ⋮ TSP race: minimizing completion time in time-sensitive applications ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ A branch-and-cut algorithm for the preemptive swapping problem ⋮ A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning ⋮ A branch‐and‐dive heuristic for single vehicle snow removal ⋮ Precedence-constrained arborescences ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Branch-and-bound for the precedence constrained generalized traveling salesman problem ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ The multi-pickup and delivery problem with time windows ⋮ Exact methods for solving the elementary shortest and longest path problems ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Finding the shortest path with vertex constraint over large graphs ⋮ The multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ An exact algorithm for the sequential ordering problem and its application to switching energy minimization in compilers
Uses Software
This page was built for publication: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
