The asymptotic probabilistic behaviour of quadratic sum assignment problems

DOI10.1007/BF01916903MaRDI QIDQ3668301zbMATH OpenFDO

Authors Rainer E. Burkard, Ulrich Fincke

Publication date 1983

Published in Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01916903

zbMATH Keywords

approximation algorithmasymptotic probabilistic behaviourquadratic sum assignment problemworst case behavior

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Assignment Problems and the Location of Economic Activities
• Numerical investigations on quadratic assignment problems
• On random quadratic bottleneck assignment problems
• On the Expected Value of a Random Assignment Problem
• P-Complete Approximation Problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem

Cited in

(13)

• On random quadratic bottleneck assignment problems
• Selected topics on assignment problems
• On linear programs with random costs
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem
• Some recent results in the analysis of greedy algorithms for assignment problems
• A note on asymptotic properties of the quadratic assignment problem
• Random assignment problems
• An asymptotical study of combinatorial optimization problems by means of statistical mechanics
• A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Subclasses of solvable problems from classes of combinatorial optimization problems
• Quadratic assignment problems
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach

This page was built for publication: The asymptotic probabilistic behaviour of quadratic sum assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3668301)