The preemptive swapping problem on a tree

DOI10.1002/NET.20451zbMATH Open1233.90075OpenAlexW2078190972MaRDI QIDQ3100688FDOQ3100688

Shoshana Anily, Michel Gendreau, G. Laporte

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20451

zbMATH Keywords

stacker crane problemtransshipmentswapping problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• The swapping problem
• A branch‐and‐cut algorithm for the nonpreemptive swapping problem
• Heuristics for the mixed swapping problem
• Capacitated Vehicle Routing on Trees
• Approximating Capacitated Routing and Delivery Problems
• Restricted delivery problems on a network
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Preemptive Ensemble Motion Planning on a Tree
• Nonpreemptive Ensemble Motion Planning on a Tree
• The Swapping Problem on a Line
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees
• Heuristics for vehicle routing on tree-like networks

Cited In (13)

• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system
• The swapping problem
• Models for the single-vehicle preemptive pickup and delivery problem
• The Swapping Problem on a Line
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• Polynomially solvable cases of the bipartite traveling salesman problem
• The unit-capacity constrained permutation problem
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• Heuristics for the mixed swapping problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• A branch-and-cut algorithm for the preemptive swapping problem
• Preemptive Ensemble Motion Planning on a Tree

This page was built for publication: The preemptive swapping problem on a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100688)