On random quadratic bottleneck assignment problems

DOI10.1007/BF01583791MaRDI QIDQ3938840zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Ulrich Fincke

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

probabilistic error boundsrandom quadratic bottleneck assignment problemsrelative error between best and worst solution

Mathematics Subject Classification ID

Quadratic programming (90C20) Programming involving graphs or networks (90C35)

Cites work

• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• P-Complete Approximation Problems
• The asymptotic probabilistic behaviour of quadratic sum assignment problems

Cited in

(13)

• Uncertain programming model for uncertain optimal assignment problem
• The asymptotic probabilistic behaviour of quadratic sum assignment problems
• Selected topics on assignment problems
• Quadratic bottleneck problems
• A note on the asymptotic behaviour of bottleneck problems
• A survey for the quadratic assignment problem
• Random assignment problems
• An asymptotical study of combinatorial optimization problems by means of statistical mechanics
• Probabilistic asymptotic properties of some combinatorial optimization problems
• On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon
• The random quadratic assignment problem
• Quadratic assignment problems
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach

This page was built for publication: On random quadratic bottleneck assignment problems

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