The random linear bottleneck assignment problem

DOI10.1007/3-540-59408-6_48zbMath1500.90084OpenAlexW2124134183MaRDI QIDQ5101412

Ulrich Pferschy

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_1996__30_2_127_0/

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternate strategies for solving bottleneck assignment problems - analysis and computational results
• Order statistics and the linear assignment problem
• Matchings in random regular bipartite digraphs
• On the Expected Value of a Random Assignment Problem
• Algorithms for two bottleneck optimization problems
• An algorithm to solve them ×n assignment problem in expected timeO(mn logn)

This page was built for publication: The random linear bottleneck assignment problem