Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

DOI10.1287/OPRE.19.7.1747MaRDI QIDQ5632356zbMATH OpenOpenAlexFDO

Authors Robert Garfinkel

Publication date 1971

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.19.7.1747

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(42)

• A study of the bottleneck single source transportation problem
• A generalized bottleneck assignment problem
• On the bottleneck linear programming problem
• Solving linear bottleneck assignment problems via strong spanning trees
• Application of optimization methods to the hematological support of patients with disseminated malignancies
• An augmenting path method for solving linear bottleneck assignment problems
• An algorithm for the bottleneck generalized assignment problem
• A variant of time minimizing assignment problem
• The stochastic bottleneck linear programming problem
• A variation of the assignment problem
• The three-dimensional bottleneck assignment problem with capacity constraints
• Max-min matching problems with multiple assignments
• A bilevel bottleneck programming problem
• The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
• Bottleneck assignment problems under categorization
• The dominance assignment problem
• An alternate approach to solve two-level priority based assignment problem
• A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
• Rejoinder: Matching methods for observational studies derived from large administrative databases
• Assignment problems with changeover cost
• A priority based assignment problem
• A priority based unbalanced time minimization assignment problem
• An improved algorithm for two stage time minimization assignment problem
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Task preference-based bottleneck assignment problem
• Exact solution approaches for bilevel assignment problems
• Serve or skip: the power of rejection in online bottleneck matching
• The three dimensional bottleneck assignment problem and its variants
• Bicriteria bottleneck linear programming problem
• Bottleneck linear programming
• An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
• On bilevel fractional programming
• Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
• scientific article; zbMATH DE number 7415106 (Why is no real title available?)
• A class of bottleneck expansion problems
• Time–cost trade-off in a multi-choice assignment problem
• Speed of performance of a group of controlled objects
• Selected topics on assignment problems
• PeerReview4All: fair and accurate reviewer assignment in peer review
• A perfect matching algorithm for sparse bipartite graphs
• Bilevel time minimizing assignment problem
• Bottleneck flows in unit capacity networks

This page was built for publication: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

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