On the public citation graph
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
0 signed · 167 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.1002/net.3230010206openalex-snapshot
On some techniques useful for solution of transportation network problems
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1137/0208036openalex-snapshot
On the Expected Value of a Random Assignment Problem
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ecja.4410650706openalex-snapshot
Probabilistic analysis of a sequential algorithm for finding independent sets
inferred← citeshttps://doi.org/10.1002/nav.20065openalex-snapshot
Scheduling and lot streaming in two‐machine open shops with no‐wait in process
inferred← citeshttps://doi.org/10.1002/nav.21721openalex-snapshot
Level workforce planning for multistage transfer lines
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.3230110209openalex-snapshot
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects
inferred← citeshttps://doi.org/10.1002/net.3230150306openalex-snapshot
Probabilistic analysis of a network design problem heuristic
inferred← citeshttps://doi.org/10.1002/rsa.1015openalex-snapshot
The ζ(2) limit in the random assignment problem
inferred← citeshttps://doi.org/10.1002/rsa.70052openalex-snapshot
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
inferred← citeshttps://doi.org/10.1007/0-387-23667-8_14openalex-snapshot
Using Group Theory to Construct and Characterize Metaheuristic Search Neighborhoods
inferred← citeshttps://doi.org/10.1007/11922377_8openalex-snapshot
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_27openalex-snapshot
Recent advances in the probabilistic analysis of graph-theoretic algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44808-x_3openalex-snapshot
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
inferred← citeshttps://doi.org/10.1007/3-540-45365-2_21openalex-snapshot
Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_9openalex-snapshot
Construction Heuristics and Domination Analysis for the Asymmetric TSP
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_84openalex-snapshot
Data Correcting Approach for Routing and Location in Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-9464-8_11openalex-snapshot
Algorithms with Random Input
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_2openalex-snapshot
Maximization of Submodular Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_3openalex-snapshot
Data Correcting Approach for the Maximization of Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_4openalex-snapshot
Data Correcting Approach for the Simple Plant Location Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_84-1openalex-snapshot
Data Correcting Approach for Routing and Location in Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-11854-3_41openalex-snapshot
Iteration Multilevel Method for the Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-73441-5_36openalex-snapshot
Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-21515-5_42openalex-snapshot
Collaborative Optimization under a Control Framework for ATSP
inferred← citeshttps://doi.org/10.1007/978-3-642-67091-6_15openalex-snapshot
The Complexity of Combinatorial Computations: An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-662-09444-0_1openalex-snapshot
The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-8348-9461-8_8openalex-snapshot
Ganzzahlige Lineare Programmierung
inferred← citeshttps://doi.org/10.1007/bf01192048openalex-snapshot
Minimean optimal key arrangements in hash tables
inferred← citeshttps://doi.org/10.1007/bf01314278openalex-snapshot
Searching for optimal configurations by simulated tunneling
inferred← citeshttps://doi.org/10.1007/bf01581188openalex-snapshot
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1007/bf01583791openalex-snapshot
On random quadratic bottleneck assignment problems
inferred← citeshttps://doi.org/10.1007/bf01585751openalex-snapshot
On patching algorithms for random asymmetric travelling salesman problems
inferred← citeshttps://doi.org/10.1007/bf01916903openalex-snapshot
The asymptotic probabilistic behaviour of quadratic sum assignment problems
inferred← citeshttps://doi.org/10.1007/bf02022564openalex-snapshot
An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
inferred← citeshttps://doi.org/10.1007/bf02241753openalex-snapshot
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
inferred← citeshttps://doi.org/10.1007/bf02253612openalex-snapshot
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
inferred← citeshttps://doi.org/10.1007/bfb0008936openalex-snapshot
Probabilistic analysis of some travelling salesman heuristics
inferred← citeshttps://doi.org/10.1007/s00180-015-0635-1openalex-snapshot
Ordered spatial sampling by means of the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s10288-012-0206-zopenalex-snapshot
Exact algorithms for different classes of vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10601-011-9114-7openalex-snapshot
Constraint-based Very Large-Scale Neighborhood search
inferred← citeshttps://doi.org/10.1007/s10898-018-0708-0openalex-snapshot
A cutting plane method for risk-constrained traveling salesman problem with random arc costs
inferred← citeshttps://doi.org/10.1007/s10951-009-0135-7openalex-snapshot
Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching
inferred← citeshttps://doi.org/10.1007/s10951-010-0175-zopenalex-snapshot
Erratum to: Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching
inferred← citeshttps://doi.org/10.1007/s11740-019-00947-7openalex-snapshot
A shifting bottleneck procedure with multiple objectives in a complex manufacturing environment
inferred← citeshttps://doi.org/10.1007/s13676-012-0010-0openalex-snapshot
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison
inferred← citeshttps://doi.org/10.1007/s42979-024-03420-0openalex-snapshot
Genetic Algorithm Incorporating Group Theory for Solving the General Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00057-7openalex-snapshot
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90103-3openalex-snapshot
An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
inferred← citeshttps://doi.org/10.1016/0098-1354(90)87057-vopenalex-snapshot
An exact parallel algorithm for scheduling when production costs depend on consecutive system states
inferred← citeshttps://doi.org/10.1016/0098-1354(93)80055-ropenalex-snapshot
An exact algorithm for resource constrained sequencing with application to production scheduling under an aggregate deadline
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90037-xopenalex-snapshot
Probabilistic asymptotic properties of some combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90038-2openalex-snapshot
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90017-6openalex-snapshot
Linear expected-time algorithms for connectivity problems
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90037-5openalex-snapshot
An algorithm for finding hamilton cycles in random directed graphs
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90188-8openalex-snapshot
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90193-1openalex-snapshot
The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90138-yopenalex-snapshot
The traveling salesman problem: An overview of exact and approximate algorithms
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90044-8openalex-snapshot
Approximation algorithms for the shortest common superstring problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
inferred← citeshttps://doi.org/10.1016/b978-0-12-815715-2.00014-2openalex-snapshot
On a road to optimal fleet routing algorithms: a gentle introduction to the state-of-the-art
inferred← citeshttps://doi.org/10.1016/bs.adcom.2024.01.001openalex-snapshot
An effective genetic algorithm for solving traveling salesman problem with group theory
inferred← citeshttps://doi.org/10.1016/j.amc.2007.03.019openalex-snapshot
Randomized gravitational emulation search algorithm for symmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2012.04.008openalex-snapshot
A model induced max-min ant colony optimization for asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118012openalex-snapshot
A grand-canonical solution to a class of random optimization problems
inferred← citeshttps://doi.org/10.1016/j.cie.2011.08.004openalex-snapshot
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit
inferred← citeshttps://doi.org/10.1016/j.cor.2003.09.011openalex-snapshot
Determination of the candidate arc set for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.003openalex-snapshot
On the longest path of a randomly weighted tournament
inferred← citeshttps://doi.org/10.1016/j.dam.2025.09.029openalex-snapshot
Random walks on edge coloured random graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.10.005openalex-snapshot
Iterative patching and the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.06.040openalex-snapshot
A review of TSP based approaches for flowshop scheduling
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.12.010openalex-snapshot
A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.11.062openalex-snapshot
Random assignment problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.07.009openalex-snapshot
Distributionally robust mixed integer linear programs: Persistency models with applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.03.050openalex-snapshot
Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
inferred← citeshttps://doi.org/10.1016/j.engappai.2008.01.003openalex-snapshot
A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2011.11.028openalex-snapshot
Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.10.002openalex-snapshot
An improved approximation algorithm for the ATSP with parameterized triangle inequality
inferred← citeshttps://doi.org/10.1016/j.orl.2004.04.001openalex-snapshot
Match twice and stitch: a new TSP tour construction heuristic
inferred← citeshttps://doi.org/10.1016/j.orl.2008.12.002openalex-snapshot
Average-case approximation ratio of the 2-opt algorithm for the TSP
inferred← citeshttps://doi.org/10.1016/j.promfg.2020.01.310openalex-snapshot
Integrating Capacity and Logistics of Large Additive Manufacturing Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.026openalex-snapshot
On the relationship between ATSP and the cycle cover problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00338-9openalex-snapshot
A survey of very large-scale neighborhood search techniques
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00037-5openalex-snapshot
A note on the complexity of the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73241-9openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00149-9openalex-snapshot
Statistical mechanics methods and phase transitions in optimization problems
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00091-5openalex-snapshot
The Rural Postman Problem on mixed graphs with turn penalties
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00050-3openalex-snapshot
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00013-0openalex-snapshot
Modeling and solving several classes of arc routing problems as traveling salesman problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00197-1openalex-snapshot
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00133-2openalex-snapshot
Cluster based branching for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00468-3openalex-snapshot
Construction heuristics for the asymmetric TSP
inferred← citeshttps://doi.org/10.1016/s0895-7177(04)90544-4openalex-snapshot
Solving the aerial fleet refueling problem using group theoretic tabu search
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80107-0openalex-snapshot
Chapter 3 Stochastic and dynamic networks and routing
inferred← citeshttps://doi.org/10.1017/s0963548317000426openalex-snapshot
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
inferred← citeshttps://doi.org/10.1023/a:1020915403051openalex-snapshot
A Heuristic Algorithm for the Mixed Chinese Postman Problem
inferred← citeshttps://doi.org/10.1023/a:1024042209719openalex-snapshot
Scheduling and Lot Streaming in Flowshops with No-Wait in Process
inferred← citeshttps://doi.org/10.1023/b:heur.0000045321.59202.52openalex-snapshot
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1038/sj.jors.2601052openalex-snapshot
Solving arc routing problems with turn penalties
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1057/jors.2009.76openalex-snapshot
A concise guide to the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2601614openalex-snapshot
Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1057/s41274-016-0173-4openalex-snapshot
A dual local search framework for combinatorial optimization problems with TSP application
inferred← citeshttps://doi.org/10.1063/1.470277openalex-snapshot
A combinatorial algorithm for effective generation of long maximally compact lattice chains
inferred← citeshttps://doi.org/10.1080/00207543.2014.885662openalex-snapshot
Production lot sizing and scheduling with non-triangular sequence-dependent setup times
inferred← citeshttps://doi.org/10.1080/02331938608843104openalex-snapshot
Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
inferred← citeshttps://doi.org/10.1080/03052159708941135openalex-snapshot
EFFICIENT ROUTING OF SERVICE VEHICLES
inferred← citeshttps://doi.org/10.1080/03155986.2017.1279897openalex-snapshot
Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
inferred← citeshttps://doi.org/10.1080/05695558208975032openalex-snapshot
An Overview of Complexity Theory in Discrete Optimizations: Part I. Concepts
inferred← citeshttps://doi.org/10.1080/05695558208975042openalex-snapshot
An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications
inferred← citeshttps://doi.org/10.1088/1742-5468/2008/03/p03019openalex-snapshot
On the number ofk-cycles in the assignment problem for random matrices
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/sfcs.2002.1182004openalex-snapshot
On random symmetric travelling salesman problems
inferred← citeshttps://doi.org/10.1109/tc.1984.1676453openalex-snapshot
MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
inferred← citeshttps://doi.org/10.11118/actaun201260070171openalex-snapshot
Different versions of the savings method for the time limited vehicle routing problem
inferred← citeshttps://doi.org/10.1126/science.251.4995.754openalex-snapshot
Exact Solution of Large Asymmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1137/0210024openalex-snapshot
Optimization Problems on Graphs with Independent Random Edge Weights
inferred← citeshttps://doi.org/10.1137/0213007openalex-snapshot
The Traveling Salesman Problem with Many Visits to Few Cities
inferred← citeshttps://doi.org/10.1137/0216068openalex-snapshot
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
inferred← citeshttps://doi.org/10.1137/1133056openalex-snapshot
On Finding the Expected Length of a Random Minimal Tree
inferred← citeshttps://doi.org/10.1137/23m1623434openalex-snapshot
Hamilton Cycles in Random Digraphs with Minimum Degree at Least One
inferred← citeshttps://doi.org/10.1137/s0097539701391518openalex-snapshot
The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1137/s0097539792235384openalex-snapshot
When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
inferred← citeshttps://doi.org/10.1145/100348.100358openalex-snapshot
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1145/100348.100380openalex-snapshot
An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline
inferred← citeshttps://doi.org/10.1145/212066.212081openalex-snapshot
Exact solution of large-scale, asymmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1145/2422.322422openalex-snapshot
Random Trees and the Analysis of Branch and Bound Procedures
inferred← citeshttps://doi.org/10.1145/258915.258932openalex-snapshot
Near-optimal intraprocedural branch alignment
inferred← citeshttps://doi.org/10.1145/3510034openalex-snapshot
Traveling Transporter Problem: Arranging a New Circular Route in a Public Transportation System Based on Heterogeneous Non-Monotonic Urban Data
inferred← citeshttps://doi.org/10.1145/3526025openalex-snapshot
A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1145/3712255.3734276openalex-snapshot
On "Solving The Travelling Salesman Problem Using A Single Qubit" vs. Quantum Genetic Optimization: Are we there?
inferred← citeshttps://doi.org/10.1145/800141.804686openalex-snapshot
Linear expected-time algorithms for connectivity problems (Extended Abstract)
inferred← citeshttps://doi.org/10.1155/2017/6754970openalex-snapshot
Alternative Mathematical Models and Solution Approaches for Lot‐Sizing and Scheduling Problems in the Brewery Industry: Analyzing Two Different Situations
inferred← citeshttps://doi.org/10.1287/moor.10.1.100openalex-snapshot
Asymptotic Properties of the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1287/moor.1040.0105openalex-snapshot
On Random Symmetric Travelling Salesman Problems
inferred← citeshttps://doi.org/10.1287/moor.15.4.749openalex-snapshot
Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
inferred← citeshttps://doi.org/10.1287/opre.34.5.803openalex-snapshot
OR Forum—Perspectives on Vehicle Routing: Exciting New Developments
inferred← citeshttps://doi.org/10.1590/s0101-74382008000300003openalex-snapshot
Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal
inferred← citeshttps://doi.org/10.1613/jair.1389openalex-snapshot
Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.2139/ssrn.5507400openalex-snapshot
A Grand-Canonical Solution to a Class of Random Optimization Problems
inferred← citeshttps://doi.org/10.30585/icabml-cp.v1i1.37openalex-snapshot
Negotiating and Sharing Capacities of Large Additive Manufacturing Networks
inferred← citeshttps://doi.org/10.32657/10356/65952openalex-snapshot
Energy-efficient automated material handling systems
inferred← citeshttps://doi.org/10.36253/88-8453-042-3openalex-snapshot
Proceedings of the third International Workshop of the IFIP WG5.7
inferred← citeshttps://doi.org/10.37236/10237openalex-snapshot
Typical Values of Extremal-Weight Combinatorial Structures with Independent Symmetric Weights
inferred← citeshttps://doi.org/10.3990/1.9789036552493openalex-snapshot
Probabilistic analyses of combinatorial optimization problems on random shortest path metrics
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.2005.09922openalex-snapshot
On Limit Constants in Last Passage Percolation in Transitive Tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604113openalex-snapshot
One-in-Two-Matching Problem is NP-complete
inferred← citeshttps://doi.org/10.5555/365411.365557openalex-snapshot
The probabilistic relationship between the assignment and asymmetric traveling salesman problems
inferred← citeshttps://doi.org/10.5753/etc.2026.23818openalex-snapshot
An Exact Framework for the Trigger Arc Traveling Salesman Problem
inferred← citeshttps://doi.org/10.5772/5885openalex-snapshot
Greedy Like Algorithms for the Traveling Salesman and Multidimensional Assignment Problems
inferred← citeshttps://doi.org/10.5772/intechopen.109049openalex-snapshot
Using Group Theory to Generate Initial Population for a Genetic Algorithm for Solving Traveling Salesman
inferred← citeshttps://doi.org/10.70675/22232f00zc154z4403z9ad9zb300629d8110openalex-snapshot
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques
inferred← citeshttps://doi.org/10.7939/r3mt13openalex-snapshot
Emergency Medical Services Performance Under Dynamic Ambulance Redeployment
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.