Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
From MaRDI portal
Publication:5632356
DOI10.1287/opre.19.7.1747zbMath0225.90028OpenAlexW2130376892MaRDI QIDQ5632356
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
Related Items
The three-dimensional bottleneck assignment problem with capacity constraints, A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Exact solution approaches for bilevel assignment problems, A study of the bottleneck single source transportation problem, An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems, Max-min matching problems with multiple assignments, Serve or skip: the power of rejection in online bottleneck matching, Bilevel time minimizing assignment problem, The dominance assignment problem, A bilevel bottleneck programming problem, Task preference-based bottleneck assignment problem, An improved algorithm for two stage time minimization assignment problem, Time–cost trade-off in a multi-choice assignment problem, On bilevel fractional programming, A generalized bottleneck assignment problem, On the bottleneck linear programming problem, Rejoinder: Matching methods for observational studies derived from large administrative databases, Minimizing maximum weight of subsets of a maximum matching in a bipartite graph, Solving linear bottleneck assignment problems via strong spanning trees, The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases, Bottleneck linear programming, Bicriteria bottleneck linear programming problem, Selected topics on assignment problems, A class of bottleneck expansion problems, Bottleneck flows in unit capacity networks, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Application of optimization methods to the hematological support of patients with disseminated malignancies, Assignment problems with changeover cost, An augmenting path method for solving linear bottleneck assignment problems, A priority based assignment problem, An algorithm for the bottleneck generalized assignment problem, A priority based unbalanced time minimization assignment problem, A perfect matching algorithm for sparse bipartite graphs, Bottleneck assignment problems under categorization, A variant of time minimizing assignment problem, The stochastic bottleneck linear programming problem, Unnamed Item, A variation of the assignment problem, The three dimensional bottleneck assignment problem and its variants, An alternate approach to solve two-level priority based assignment problem
