The swapping problem
From MaRDI portal
Publication:4018998
DOI10.1002/net.3230220408zbMath0763.90080OpenAlexW2089031378MaRDI QIDQ4018998
Publication date: 16 January 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220408
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Related Items
An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, The static bicycle relocation problem with demand intervals, Approximation algorithms for the Geometric Covering Salesman Problem, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, A branch-and-cut algorithm for the preemptive swapping problem, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem, A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem, Geometric planar networks on bichromatic collinear points, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, Bike sharing systems: solving the static rebalancing problem, One-to-Many-to-One Single Vehicle Pickup and Delivery Problems, Balancing the stations of a self service “bike hire” system, Feasibility recovery for the unit-capacity constrained permutation problem, Polynomially solvable cases of the bipartite traveling salesman problem, The unit-capacity constrained permutation problem, Approximation algorithms for the Euclidean bipartite TSP, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, A branch‐and‐cut algorithm for the nonpreemptive swapping problem, The vehicle routing problem with pickups and deliveries on some special graphs, Preemptive stacker crane problem: extending tree-based properties and construction heuristics, Heuristics for the mixed swapping problem, The preemptive swapping problem on a tree, Dynamic pickup and delivery problems, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Solving the shortest route cut and fill problem using simulated annealing, A truck scheduling problem arising in intermodal container transportation
