Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
From MaRDI portal
Publication:2907956
DOI10.1051/ro/2011110zbMath1246.90018OpenAlexW2114622761MaRDI QIDQ2907956
Mathieu Lacroix, Hélène Toussaint, Alain Quilliot, Hervé L. M. Kerivin
Publication date: 4 September 2012
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222494
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Heuristics for the mixed swapping problem
- A heuristic manipulation technique for the sequential ordering problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- A heuristic for the pickup and delivery traveling salesman problem
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- k-interchange procedures for local search in a precedence-constrained routing problem
- The precedence-constrained asymmetric traveling salesman polytope
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A branch-and-cut algorithm for the preemptive swapping problem
- A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
- The preemptive swapping problem on a tree
- Nonpreemptive Ensemble Motion Planning on a Tree
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- The swapping problem
- Preemptive Ensemble Motion Planning on a Tree
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- Computer Solutions of the Traveling Salesman Problem
- An Algorithm for the Traveling Salesman Problem
