The asymptotic probabilistic behaviour of quadratic sum assignment problems
- 1 December 1983
- journal article
- research article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 27 (1) , 73-81
- https://doi.org/10.1007/bf01916903
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On random quadratic bottleneck assignment problemsMathematical Programming, 1982
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotationsComputing, 1982
- Worst-Case and Probabilistic Analysis of Algorithms for a Location ProblemOperations Research, 1980
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman ProblemSIAM Journal on Computing, 1979
- On the Expected Value of a Random Assignment ProblemSIAM Journal on Computing, 1979
- Numerical investigations on quadratic assignment problemsNaval Research Logistics Quarterly, 1978
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Assignment Problems and the Location of Economic ActivitiesEconometrica, 1957
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952