On the public citation graph
The swapping problem
0 signed · 88 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01588956openalex-snapshot
Tight bounds for christofides' traveling salesman heuristic
inferredcites →https://doi.org/10.1016/0191-2615(83)90041-3openalex-snapshot
Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem
inferredcites →https://doi.org/10.1109/sfcs.1989.63457openalex-snapshot
Ensemble motion planning in trees
inferredcites →https://doi.org/10.1137/0207017openalex-snapshot
Approximation Algorithms for Some Routing Problems
inferredcites →https://doi.org/10.1137/0217053openalex-snapshot
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
inferredcites →https://doi.org/10.1287/opre.12.5.655openalex-snapshot
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.15807/jorsj.33.354openalex-snapshot
HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4147442openalex-extracted
Bicycle Repositioning Problem with Integration of Private Vehicle and Public Transport
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(199909)46:6<654::aid-nav4>3.0.co;2-aopenalex-snapshot
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
inferred← citeshttps://doi.org/10.1002/nav.20361openalex-snapshot
A branch‐and‐cut algorithm for the nonpreemptive swapping problem
inferred← citeshttps://doi.org/10.1002/net.20116openalex-snapshot
The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
inferred← citeshttps://doi.org/10.1002/net.20447openalex-snapshot
A branch‐and‐cut algorithm for the preemptive swapping problem
inferred← citeshttps://doi.org/10.1002/net.20451openalex-snapshot
The preemptive swapping problem on a tree
inferred← citeshttps://doi.org/10.1002/net.21535openalex-snapshot
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree
inferred← citeshttps://doi.org/10.1007/11602613_105openalex-snapshot
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_10openalex-snapshot
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_16openalex-snapshot
One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_7openalex-snapshot
Geometric Planar Networks on Bichromatic Points
inferred← citeshttps://doi.org/10.1007/978-3-031-77432-4_13openalex-snapshot
Allocation and Sequencing of Missions on Autonomous Vehicles
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_8openalex-snapshot
Approximating the Bipartite TSP and Its Biased Generalization
inferred← citeshttps://doi.org/10.1007/978-3-319-07890-8_11openalex-snapshot
Another Look at the Shoelace TSP: The Case of Very Old Shoes
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_54openalex-snapshot
Approximation Algorithms for the Black and White Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/s00453-009-9290-7openalex-snapshot
Multi-Color Pebble Motion on Graphs
inferred← citeshttps://doi.org/10.1007/s10732-012-9210-xopenalex-snapshot
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s10845-015-1055-3openalex-snapshot
A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry
inferred← citeshttps://doi.org/10.1007/s11067-015-9297-3openalex-snapshot
An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot
inferred← citeshttps://doi.org/10.1007/s11750-007-0009-0openalex-snapshot
Static pickup and delivery problems: a classification scheme and survey
inferred← citeshttps://doi.org/10.1007/s12351-020-00557-7openalex-snapshot
Supply planning for shelters and emergency management crews
inferred← citeshttps://doi.org/10.1007/s13676-012-0017-6openalex-snapshot
Static repositioning in a bike-sharing system: models and solution approaches
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90008-6openalex-snapshot
Approximation algorithms for the geometric covering salesman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2009.03.032openalex-snapshot
Heuristics for the mixed swapping problem
inferred← citeshttps://doi.org/10.1016/j.cor.2018.04.016openalex-snapshot
Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.cstp.2023.101071openalex-snapshot
Rebalancing in bike sharing systems: Application to the Lisbon case study
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.013openalex-snapshot
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.025openalex-snapshot
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2012.07.002openalex-snapshot
The uncapacitated swapping problem on a line and on a circle
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.11.005openalex-snapshot
Bike sharing systems: Solving the static rebalancing problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.09.004openalex-snapshot
Feasibility recovery for the Unit-capacity Constrained Permutation Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.05.009openalex-snapshot
The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.04.024openalex-snapshot
Dynamic pickup and delivery problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.04.042openalex-snapshot
A truck scheduling problem arising in intermodal container transportation
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.04.013openalex-snapshot
The static bicycle relocation problem with demand intervals
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.10.053openalex-snapshot
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.060openalex-snapshot
Polynomially solvable cases of the bipartite traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.04.033openalex-snapshot
An unpaired pickup and delivery problem with time dependent assignment costs: Application in air cargo transportation
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.01.049openalex-snapshot
The Unit-capacity Constrained Permutation Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.10.051openalex-snapshot
Preemptive stacker crane problem: Extending tree-based properties and construction heuristics
inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.006openalex-snapshot
Tree based heuristics for the preemptive asymmetric stacker crane problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2012.06.009openalex-snapshot
The selective pickup and delivery problem: Formulation and a memetic algorithm
inferred← citeshttps://doi.org/10.1016/j.neucom.2023.126631openalex-snapshot
A survey of dynamic pickup and delivery problems
inferred← citeshttps://doi.org/10.1016/j.orl.2004.08.002openalex-snapshot
Approximation algorithms for the Euclidean bipartite TSP
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107130openalex-snapshot
The bipartite travelling salesman problem: A pyramidally solvable case
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.035openalex-snapshot
Geometric planar networks on bichromatic collinear points
inferred← citeshttps://doi.org/10.1016/j.tra.2026.105190openalex-snapshot
Data-driven rebalancing support for station-based bike sharing: A hybrid centralized-distributed deployment in Chiba city
inferred← citeshttps://doi.org/10.1016/j.trb.2016.05.010openalex-snapshot
A multiple type bike repositioning problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00283-3openalex-snapshot
The vehicle routing problem with pickups and deliveries on some special graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00206-0openalex-snapshot
Solving the shortest route cut and fill problem using simulated annealing
inferred← citeshttps://doi.org/10.1023/a:1014923704338openalex-snapshot
Approximation Algorithms for Pick-and-Place Robots
inferred← citeshttps://doi.org/10.1051/ro/2011102openalex-snapshot
Balancing the stations of a self service “bike hire” system
inferred← citeshttps://doi.org/10.1051/ro/2011110openalex-snapshot
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
inferred← citeshttps://doi.org/10.1080/19427867.2023.2294185openalex-snapshot
A many-to-many pick-up and delivery problem under stochastic battery depletion of electric vehicles
inferred← citeshttps://doi.org/10.1109/cipls.2013.6595207openalex-snapshot
Solving the biobjective selective pickup and delivery problem with memetic algorithm
inferred← citeshttps://doi.org/10.1109/comst.2026.3731146openalex-snapshot
Approximation Algorithms for Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1109/icadlt.2015.7136598openalex-snapshot
Management of mobile resources in Physical Internet logistic models
inferred← citeshttps://doi.org/10.1109/itsc.2018.8569912openalex-snapshot
Minimum Walking Static Repositioning in Free-Floating Electric Car-Sharing Systems
inferred← citeshttps://doi.org/10.1109/tits.2020.2995197openalex-snapshot
Optimizing Relocation Cost in Free-Floating Car-Sharing Systems
inferred← citeshttps://doi.org/10.1137/s0097539701392056openalex-snapshot
Algorithms for Capacitated Vehicle Routing
inferred← citeshttps://doi.org/10.1137/s0097539795295468openalex-snapshot
Approximating Capacitated Routing and Delivery Problems
inferred← citeshttps://doi.org/10.1137/s0097539797323108openalex-snapshot
The Swapping Problem on a Line
inferred← citeshttps://doi.org/10.1145/276698.276786openalex-snapshot
Algorithms for capacitated vehicle routing
inferred← citeshttps://doi.org/10.1145/3219819.3219873openalex-snapshot
Towards Station-Level Demand Prediction for Effective Rebalancing in Bike-Sharing Systems
inferred← citeshttps://doi.org/10.1177/0020294019877521openalex-snapshot
Prediction and optimization of sharing bikes queuing model in grid of Geohash coding
inferred← citeshttps://doi.org/10.1177/0278364918780999openalex-snapshot
Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps
inferred← citeshttps://doi.org/10.12681/eadd/39143openalex-snapshot
Paratransit services under normal and emergency conditions using public transport resources
inferred← citeshttps://doi.org/10.1287/trsc.1030.0086openalex-snapshot
Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/trsc.1110.0400openalex-snapshot
Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints
inferred← citeshttps://doi.org/10.1287/trsc.2015.0637openalex-snapshot
An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines
inferred← citeshttps://doi.org/10.15388/22-infor485openalex-snapshot
A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions
inferred← citeshttps://doi.org/10.2139/ssrn.6560405openalex-snapshot
Deep Learning--Accelerated Multi-Start Large Neighborhood Search for Real-time Freight Bundling
inferred← citeshttps://doi.org/10.33723/rs.472640openalex-snapshot
HAVA KARGO TAŞIMACILIĞINDA UYGULANAN STRATEJİLERİN İNCELENMESİ
inferred← citeshttps://doi.org/10.3390/asi8030066openalex-snapshot
An Agent-Based Simulation and Optimization Approach for Sustainable Urban Logistics: A Case Study in Lisbon
inferred← citeshttps://doi.org/10.3390/systems12090374openalex-snapshot
A Study of the Main Mathematical Models Used in Mobility, Storage, Pickup and Delivery in Urban Logistics: A Systematic Review
inferred← citeshttps://doi.org/10.70675/0bb7f80dz6f41z43d4z8d1czdf48d639c3d6openalex-snapshot
Problèmes de tournées de véhicules pour la livraison de béton frais
inferred← citeshttps://doi.org/10.70675/20bd3551z55b2z4669z8a38ze1f5744ed5c9openalex-snapshot
Optimisation de la logistique hospitalière : problème conjoint de tournées de véhicules et de planification des chauffeurs
inferred← citeshttps://doi.org/10.70675/2defb1b3z60d9z4be9z93fbz6616c1285efcopenalex-snapshot
Algorithmes pour les problèmes de tournées à la demande
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.