On the public citation graph
The asymptotic probabilistic behaviour of quadratic sum assignment problems
0 signed · 49 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/nav.3800250111openalex-snapshot
Numerical investigations on quadratic assignment problems
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf01583791openalex-snapshot
On random quadratic bottleneck assignment problems
inferredcites →https://doi.org/10.1007/bf02241753openalex-snapshot
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
inferredcites →https://doi.org/10.1137/0208036openalex-snapshot
On the Expected Value of a Random Assignment Problem
inferredcites →https://doi.org/10.1137/0208045openalex-snapshot
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation 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/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferredcites →https://doi.org/10.1287/opre.28.4.847openalex-snapshot
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
inferredcites →https://doi.org/10.2307/1907742openalex-snapshot
Assignment Problems and the Location of Economic Activities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(199906)46:4<373::aid-nav3>3.0.co;2-wopenalex-snapshot
Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_405openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_534openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_1152openalex-snapshot
Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_27openalex-snapshot
The Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3155-2_8openalex-snapshot
Heuristics for Nonlinear Assignment Problems
inferred← citeshttps://doi.org/10.1007/978-3-322-94662-1_28openalex-snapshot
EXIST — ein Expertensystem zur innerbetrieblichen Standortplanung
inferred← citeshttps://doi.org/10.1007/978-3-642-72557-9_105openalex-snapshot
Probabilistische Analyse von Optimierungs-Algorithmen
inferred← citeshttps://doi.org/10.1007/978-3-642-77810-0_61openalex-snapshot
Ein wissensbasiertes Assistenzsystem für die Fabriklayoutplanung
inferred← citeshttps://doi.org/10.1007/978-3-642-78486-6_28openalex-snapshot
Qualifikationsgerechte Unterstützung durch offene Arbeitsumgebungen — Leitideen für Werkzeuge der Logistikplaner
inferred← citeshttps://doi.org/10.1007/978-3-662-12788-9_2openalex-snapshot
Probabilistic Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/bf00046618openalex-snapshot
Probabilistic analysis of optimization algorithms-some aspects from a practical point of view
inferred← citeshttps://doi.org/10.1007/bf01589437openalex-snapshot
On linear programs with random costs
inferred← citeshttps://doi.org/10.1007/bf01719448openalex-snapshot
Some recent results in the analysis of greedy algorithms for assignment problems
inferred← citeshttps://doi.org/10.1007/bf01894081openalex-snapshot
Minimizing distortion and internal forces in truss structures via simulated annealing
inferred← citeshttps://doi.org/10.1007/bfb0043834openalex-snapshot
Assignment problems: Recent solution methods and applications
inferred← citeshttps://doi.org/10.1007/s10559-009-9088-2openalex-snapshot
Subclasses of solvable problems from classes of combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s11590-010-0198-6openalex-snapshot
On optimality of a polynomial algorithm for random linear multidimensional assignment problem
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(88)90028-4openalex-snapshot
A note on asymptotic properties of the quadratic assignment problem
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90093-6openalex-snapshot
Quadratic assignment problems
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/j.cam.2005.03.068openalex-snapshot
An asymptotical study of combinatorial optimization problems by means of statistical mechanics
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.11.062openalex-snapshot
Random assignment problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00343-2openalex-snapshot
Selected topics on assignment problems
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)89285-xopenalex-snapshot
Task assignment in Cayley interconnection topologies
inferred← citeshttps://doi.org/10.1016/s0954-1810(97)00009-5openalex-snapshot
The role of explanations in an intelligent assistant system
inferred← citeshttps://doi.org/10.1201/9781420050387.ptgopenalex-snapshot
Evolutionary Computation in Practice
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.16.2.223openalex-snapshot
Stochastic Analysis of the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1287/opre.33.5.1024openalex-snapshot
Using Confidence Limits for the Global Optimum in Combinatorial Optimization
inferred← citeshttps://doi.org/10.13189/ujam.2013.010103openalex-snapshot
Interval Linear Assignment Problems
inferred← citeshttps://doi.org/10.17615/k256-xr13openalex-snapshot
Continuous Optimization Methods for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.2514/6.1990-1095openalex-snapshot
Minimizing Distortion and Internal Forces in Truss Structures by Simulated Annealing
inferred← citeshttps://doi.org/10.2514/6.1991-1095openalex-snapshot
Minimizing distortion in truss structures - A comparison of simulated annealing and TABU search
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.