On the public citation graph
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
0 signed · 90 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.1016/0304-3975(77)90012-3openalex-snapshot
The Euclidean travelling salesman problem is NP-complete
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/321958.321974openalex-snapshot
On the complexity of edge traversing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.10028openalex-snapshot
Better approximation ratios for the single‐vehicle scheduling problems on line‐shaped networks
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.1007/3-540-46521-9_11openalex-snapshot
The Online Dial-a-Ride Problem under Reasonable Load
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_53openalex-snapshot
Online Dial-a-Ride Problems: Minimizing the Completion Time
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_280openalex-snapshot
Vehicle scheduling on a tree with release and handling times
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_4openalex-snapshot
Serving requests with on-line routing
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_63openalex-snapshot
Competitive algorithms for the on-line traveling salesman
inferred← citeshttps://doi.org/10.1007/978-1-4471-2265-4_17openalex-snapshot
Stability with Uniform Bounds for On-line Dial-a-Ride Problems under Reasonable Load
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_32openalex-snapshot
Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-71645-4_20openalex-snapshot
The Generalized One-to-One Pickup and Delivery Vehicle Routing Problem
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-24587-2_62openalex-snapshot
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
inferred← citeshttps://doi.org/10.1007/978-3-662-62223-0_4openalex-snapshot
Scheduling mobiler Gebrauchsfaktoren
inferred← citeshttps://doi.org/10.1007/bf01324886openalex-snapshot
Sequencing of parts and robot moves in a robotic cell
inferred← citeshttps://doi.org/10.1007/s00453-017-0282-8openalex-snapshot
How to Sort by Walking and Swapping on Paths and Trees
inferred← citeshttps://doi.org/10.1007/s00453-022-01061-4openalex-snapshot
Improved Bounds for Open Online Dial-a-Ride on the Line
inferred← citeshttps://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferred← citeshttps://doi.org/10.1007/s10878-010-9349-zopenalex-snapshot
Models for the single-vehicle preemptive pickup and delivery problem
inferred← citeshttps://doi.org/10.1007/s10878-022-00955-xopenalex-snapshot
Approximation algorithms for some min–max and minimum stacker crane cover problems
inferred← citeshttps://doi.org/10.1007/s10951-005-6811-3openalex-snapshot
A Hard Dial-a-Ride Problem that is Easy on Average
inferred← citeshttps://doi.org/10.1007/s10951-017-0520-6openalex-snapshot
Crane scheduling in railway yards: an analysis of computational complexity
inferred← citeshttps://doi.org/10.1007/s10951-017-0538-9openalex-snapshot
Scheduling electric vehicles and locating charging stations on a path
inferred← citeshttps://doi.org/10.1007/s10951-022-00758-2openalex-snapshot
How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring
inferred← citeshttps://doi.org/10.1007/s11424-015-4197-7openalex-snapshot
The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
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/s40305-021-00372-7openalex-snapshot
Approximation Algorithms for Multi-vehicle Stacker Crane Problems
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90030-qopenalex-snapshot
Dynamic sequencing of robot moves in a manufacturing cell
inferred← citeshttps://doi.org/10.1016/j.atres.2025.09.003openalex-snapshot
The cumulative cost pickup and delivery problem on rings
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.2022.105956openalex-snapshot
Pallet location and job scheduling in a Twin-Robot system
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.020openalex-snapshot
How to collect balls moving in the Euclidean plane
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.016openalex-snapshot
Semi-preemptive routing on trees
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.2009.01.001openalex-snapshot
Semi-preemptive routing on a linear and circular track
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.09.001openalex-snapshot
Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system
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.ejor.2021.07.050openalex-snapshot
Pickup and delivery problems with autonomous vehicles on rings
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.12.044openalex-snapshot
Stuck in the middle: Optimization of long-haul trucking with battery trailer support
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.01.052openalex-snapshot
Sorting goods with an industrial robot arm: Robot scheduling, destination assignment, and layout design
inferred← citeshttps://doi.org/10.1016/j.endm.2004.03.046openalex-snapshot
Semi–preemptive routing on a line
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.entcs.2003.12.015openalex-snapshot
How to Collect Balls Moving in the Euclidean Plane
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.07.007openalex-snapshot
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
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/s0166-218x(00)00390-5openalex-snapshot
Euler is standing in line dial-a-ride problems with precedence-constraints
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00074-7openalex-snapshot
Routing a vehicle of capacity greater than one
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00261-9openalex-snapshot
On-line single-server dial-a-ride problems
inferred← citeshttps://doi.org/10.1023/a:1018928911513openalex-snapshot
Vehicle scheduling on a tree with release and handling times
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.1109/auteee52864.2021.9668636openalex-snapshot
Operation system design of SMA automatic trim machine based on PLC
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426164openalex-snapshot
Models and efficient algorithms for pickup and delivery problems on roadmaps
inferred← citeshttps://doi.org/10.1109/coase.2013.6653908openalex-snapshot
Energy-efficient dispatching solution in an automated air cargo terminal
inferred← citeshttps://doi.org/10.1109/coase.2017.8256111openalex-snapshot
Energy-efficient elevating transfer vehicle routing for automated multi-level material handling systems
inferred← citeshttps://doi.org/10.1109/comst.2026.3731146openalex-snapshot
Approximation Algorithms for Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1109/ieem.2012.6837964openalex-snapshot
Online dispatching of rail-guided vehicles in an automated air cargo terminal
inferred← citeshttps://doi.org/10.1109/sccc.1997.637087openalex-snapshot
The very offline k-vehicle routing problem in trees
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63457openalex-snapshot
Ensemble motion planning in trees
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743496openalex-snapshot
The finite capacity dial-a-ride problem
inferred← citeshttps://doi.org/10.1109/tac.2013.2259993openalex-snapshot
Asymptotically Optimal Algorithms for One-to-One Pickup and Delivery Problems With Applications to Transportation Systems
inferred← citeshttps://doi.org/10.1109/tase.2019.2921631openalex-snapshot
Energy-Efficient Elevating Transfer Vehicle Routing for Automated Multi-Level Material Handling Systems
inferred← citeshttps://doi.org/10.1137/0221066openalex-snapshot
Preemptive Ensemble Motion Planning on a Tree
inferred← citeshttps://doi.org/10.1137/0222005openalex-snapshot
A Note on the Complexity of a Simple Transportation Problem
inferred← citeshttps://doi.org/10.1137/1.9781611974782.63openalex-snapshot
Tight Bounds for Online TSP on the Line
inferred← citeshttps://doi.org/10.1137/19m1268513openalex-snapshot
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line
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.1137/s0895480197319951openalex-snapshot
Multiple Capacity Vehicle Routing on Paths
inferred← citeshttps://doi.org/10.1145/276698.276786openalex-snapshot
Algorithms for capacitated vehicle routing
inferred← citeshttps://doi.org/10.1145/3422362openalex-snapshot
Tight Bounds for Online TSP on the Line
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0052openalex-snapshot
Computer-Aided Complexity Classification of Dial-a-Ride Problems
inferred← citeshttps://doi.org/10.1287/serv.2023.0005openalex-snapshot
Jam in the Tunnel: On Urban Freight Tunnels, Their Operational Scheduling, and Unused Transport Capacity
inferred← citeshttps://doi.org/10.1287/trsc.2021.1051openalex-snapshot
Walk the Line: Optimizing the Layout Design of Moving Walkways
inferred← citeshttps://doi.org/10.1299/jamdsm.2016jamdsm0045openalex-snapshot
Approximation algorithms for a sequencing problem with a biased bipartite structure
inferred← citeshttps://doi.org/10.15807/jorsj.39.345openalex-snapshot
VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19796openalex-snapshot
An Exact Algorithm for the Linear Tape Scheduling Problem
inferred← citeshttps://doi.org/10.32657/10356/65952openalex-snapshot
Energy-efficient automated material handling systems
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/8fa1b961za441z4dc6zba7fzb593312660acopenalex-snapshot
Models and algorithms for fleet management of autonomous vehicles
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.