On extended formulations for the precedence constrained asymmetric traveling salesman problem
From MaRDI portal
Publication:5487814
DOI10.1002/net.20122zbMath1103.90084OpenAlexW4245394219MaRDI QIDQ5487814
No author found.
Publication date: 12 September 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00281586/file/PCATSP_Article.pdf
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (18)
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem ⋮ Models for a Steiner multi-ring network design problem with revenues ⋮ Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem ⋮ Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem ⋮ An improved ant colony system for the sequential ordering problem ⋮ The multiple Steiner TSP with order constraints: complexity and optimization algorithms ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ An integer programming approach for the search of discretization orders in distance geometry problems ⋮ Compact formulations for multi-depot routing problems: theoretical and computational comparisons ⋮ Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm ⋮ Natural and extended formulations for the time-dependent traveling salesman problem ⋮ Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks ⋮ Combinatorial Benders cuts for assembly line balancing problems with setups ⋮ Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? ⋮ The multi-commodity pickup-and-delivery traveling salesman problem ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks ⋮ The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
This page was built for publication: On extended formulations for the precedence constrained asymmetric traveling salesman problem
