On the public citation graph

Optimal control of plotting and drilling machines: A case study

https://doi.org/10.1007/bf01415960
0 signed · 77 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1002/nadc.19540021004openalex-snapshot
Schwerpunktprogramm der Deutschen Forschungsgemeinschaft
inferredcites →https://doi.org/10.1002/zamm.19890691107openalex-snapshot
Via Minimization with Pin Preassignments and Layer Preference
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50011-6openalex-snapshot
Practical use of Bucketing Techniques in Computational Geometry
inferredcites →https://doi.org/10.2307/2008459openalex-snapshot
Mathematical Programming: Recent Developments and Applications.
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470612491.ch9openalex-snapshot
An Overview of Applications
inferred← citeshttps://doi.org/10.1002/9781394294985.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/net.20073openalex-snapshot
On a routing and scheduling problem concerning multiple edge traversals in graphs
inferred← citeshttps://doi.org/10.1002/net.21985openalex-snapshot
On approximate data reduction for the Rural Postman Problem: Theory and experiments
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_20openalex-snapshot
On $$(1+\varepsilon )$$ -approximate Data Reduction for the Rural Postman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-33394-2_33openalex-snapshot
A Cost Minimizing at Laser Cutting of Sheet Parts on CNC Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-67731-2_24openalex-snapshot
The Multiple Traveling Salesman Problem on Spiders
inferred← citeshttps://doi.org/10.1007/978-3-030-68520-1_3openalex-snapshot
A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_19openalex-snapshot
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-32034-2_30openalex-snapshot
An Analysis of the Hardness of Novel TSP Iberian Instances
inferred← citeshttps://doi.org/10.1007/978-3-322-83563-5_10openalex-snapshot
Steuerung von Produktionsmaschinen
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_101openalex-snapshot
Self-organizing Feature Maps to Solve the Undirected Rural Postman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_15openalex-snapshot
A Hard Problem: The TSP
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8openalex-snapshot
Facets of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_1openalex-snapshot
Martin Grötschel—The Early Years in Bonn and Augsburg
inferred← citeshttps://doi.org/10.1007/978-3-642-76119-5_55openalex-snapshot
Polyedrische Methoden zur Lösung großer kombinatorischer Optimierungsprobleme
inferred← citeshttps://doi.org/10.1007/978-3-642-79763-7_26openalex-snapshot
Bestimmung optimaler Einsatzpläne für Flugpersonal
inferred← citeshttps://doi.org/10.1007/978-3-8348-9120-4_4openalex-snapshot
Schnelle Rundreisen: Das Travelling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/bf01293485openalex-snapshot
New primal and dual matching heuristics
inferred← citeshttps://doi.org/10.1007/s00521-014-1717-7openalex-snapshot
A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s00521-015-1978-9openalex-snapshot
A novel discrete bat algorithm for solving the travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s11071-019-05092-5openalex-snapshot
Continuous relaxations for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s40314-019-0976-4openalex-snapshot
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
inferred← citeshttps://doi.org/10.1016/b978-0-12-405163-8.00013-2openalex-snapshot
Discrete Firefly Algorithm for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2025.112998openalex-snapshot
Discrete Differentiated Creative Search for traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.cogsys.2017.04.006openalex-snapshot
MetrIntMeas a novel metric for measuring the intelligence of a swarm of cooperating agents
inferred← citeshttps://doi.org/10.1016/j.cor.2005.02.014openalex-snapshot
A constructive heuristic for the Undirected Rural Postman Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.10.012openalex-snapshot
Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: An application to fish aggregating devices
inferred← citeshttps://doi.org/10.1016/j.jocs.2013.05.009openalex-snapshot
A new population seeding technique for permutation-coded Genetic Algorithm: Service transfer approach
inferred← citeshttps://doi.org/10.1016/j.jocs.2023.102156openalex-snapshot
The Hamiltonian Cycle and Travelling Salesperson problems with traversal-dependent edge deletion
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115435openalex-snapshot
A 3/4 differential approximation algorithm for traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601161openalex-snapshot
The laser-plotter beam routing problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602507openalex-snapshot
Regional surveillance of disjoint rectangles: a travelling salesman formulation
inferred← citeshttps://doi.org/10.1063/1.5136388openalex-snapshot
Using the ε-constraint method to solve the multicriteria path planning problem
inferred← citeshttps://doi.org/10.1080/02664763.2025.2547801openalex-snapshot
Order-of-addition experiments for sequential adjacency relationship problems
inferred← citeshttps://doi.org/10.1093/jigpal/jzz069openalex-snapshot
Economical connections between several European countries based on TSP data
inferred← citeshttps://doi.org/10.1103/physreva.95.032323openalex-snapshot
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
inferred← citeshttps://doi.org/10.1109/aicai.2019.8701246openalex-snapshot
Travelling Salesman Problem Optimization Using Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/apccas51387.2021.9687781openalex-snapshot
Theoretical and Experimental Analysis of Traveling Salesman Walk Problem
inferred← citeshttps://doi.org/10.1109/csicc52343.2021.9420610openalex-snapshot
Solving TSP Problem in Cloud Computing using Improved Cultural Algorithm
inferred← citeshttps://doi.org/10.1109/icaci65340.2025.11096345openalex-snapshot
A Collaborative Neurodynamic Optimization Algorithm Based on Boltzmann Machines and 2-Opt Heuristic for Solving the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/icices.2014.7033850openalex-snapshot
Variants of travelling salesman problem: A survey
inferred← citeshttps://doi.org/10.1109/iseda59274.2023.10218491openalex-snapshot
Weight Uncertainty in Transformer Network for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/tevc.2022.3215174openalex-snapshot
Decomposition-Based Lin–Kernighan Heuristic With Neighborhood Structure Transfer for Multi/Many-Objective Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/tla.2004.1468639openalex-snapshot
Multi-agent Systems Applied to the Solution of the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1109/uksim.2014.18openalex-snapshot
Path Planning for Process Modelling in Chemical Engineering
inferred← citeshttps://doi.org/10.1145/3520304.3533968openalex-snapshot
Exactly characterizable parameter settings in a crossoverless evolutionary algorithm
inferred← citeshttps://doi.org/10.1145/3600100.3623736openalex-snapshot
An End-to-End Solution for Spatial Inference in Smart Buildings
inferred← citeshttps://doi.org/10.1287/mnsc.39.6.657openalex-snapshot
Solving Airline Crew Scheduling Problems by Branch-and-Cut
inferred← citeshttps://doi.org/10.1364/cleo_fs.2026.fm3a.7openalex-snapshot
A silicon photonics quantum solver for the travelling salesman problem
inferred← citeshttps://doi.org/10.17770/etr2015vol3.188openalex-snapshot
Path Planning Methods in Chemical Engineering
inferred← citeshttps://doi.org/10.3384/diss.diva-116859openalex-snapshot
On Some Combinatorial Optimization Problems : Algorithms and Complexity
inferred← citeshttps://doi.org/10.3389/frobt.2015.00018openalex-snapshot
Analyzing the Effects of Instance Features and Algorithm Parameters for Max–Min Ant System and the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.3390/a15010009openalex-snapshot
Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems
inferred← citeshttps://doi.org/10.3390/math8050752openalex-snapshot
On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP
inferred← citeshttps://doi.org/10.35848/1347-4065/ac55e2openalex-snapshot
Integrated photonic traveling salesman problem probabilistic solver with polynomial calculation time complexity
inferred← citeshttps://doi.org/10.37398/jsr.2022.660416openalex-snapshot
Solving Travelling Salesman Problem using Artificial Immune System Optimization (AISO)
inferred← citeshttps://doi.org/10.4018/ijcini.2019070101openalex-snapshot
A Branch-and-Bound-Based Crossover Operator for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07210openalex-snapshot
Reversible Action Design for Combinatorial Optimization with Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2104.13197openalex-snapshot
The 1-1 algorithm for Travelling Salesman Problem
inferred← citeshttps://doi.org/10.5380/relainep.v7i11.66092openalex-snapshot
LOGÍSTICA PARA O RECOLHIMENTO DE FRUTAS: UM ESTUDO DE CASO
inferred← citeshttps://doi.org/10.5380/relainep.v9i15.80153openalex-snapshot
LOGÍSTICA PARA ROTAS DE DISTRIBUIÇÃO: UM ESTUDO DE CASO
inferred← citeshttps://doi.org/10.5772/12909openalex-snapshot
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
inferred← citeshttps://doi.org/10.5772/547openalex-snapshot
Traveling Salesman Problem, Theory and Applications
inferred← citeshttps://doi.org/10.5784/21-1-17openalex-snapshot
Efficient heuristics for the Rural Postman Problem
inferred← citeshttps://doi.org/10.65109/bhbs7568openalex-snapshot
Patrol Scheduling Against Adversaries with Varying Attack Durations
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.