A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

DOI10.1016/j.automatica.2022.110240zbMath1485.93039arXiv2008.12508OpenAlexW4220709818MaRDI QIDQ2125539

Mitchell Khoo, Tony A. Wood, Iman Shames, Chris Manzie

Publication date: 14 April 2022

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.12508

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Multi-agent systems (93A16)

Cites Work

• Unnamed Item
• Unnamed Item
• Assignment problems: a golden anniversary survey
• Lexicographic bottleneck problems
• An augmenting path method for solving linear bottleneck assignment problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Exact lexicographic scheduling and approximate rescheduling
• Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
• TWO THEOREMS IN GRAPH THEORY
• Assignment Problems
• Algorithms for two bottleneck optimization problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness