Solution methods and computational investigations for the linear bottleneck assignment problem
From MaRDI portal
(Redirected from Publication:1377280)
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Recommendations
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- The random linear bottleneck assignment problem
- The random linear bottleneck assignment problem
- Solving linear bottleneck assignment problems via strong spanning trees
- An algorithm for the bottleneck generalized assignment problem
- The bottleneck generalized assignment problem
- Linear assignment problems in combinatorial optimization
- Approximating the multi-level bottleneck assignment problem
- Approximating the multi-level bottleneck assignment problem
Cites work
- scientific article; zbMATH DE number 995809 (Why is no real title available?)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 3943863 (Why is no real title available?)
- Algorithm for the solution of the assignment problem for sparse matrices
- Algorithms for two bottleneck optimization problems
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An augmenting path method for solving linear bottleneck assignment problems
- An efficient labeling technique for solving sparse assignment problems
- An in-core/out-of-core method for solving large scale assignment problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Cited in
(14)- A priority based assignment problem
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- Selected topics on assignment problems
- An alternate approach to solve two-level priority based assignment problem
- Bottleneck flows in unit capacity networks
- Quadratic bottleneck problems
- A new matrix bandwidth reduction algorithm
- Task preference-based bottleneck assignment problem
- Sensitivity analysis for bottleneck assignment problems
- The random linear bottleneck assignment problem
- A priority based unbalanced time minimization assignment problem
- Solving linear bottleneck assignment problems via strong spanning trees
- Allocation of indivisible items with individual preference graphs
- An improved algorithm for two stage time minimization assignment problem
This page was built for publication: Solution methods and computational investigations for the linear bottleneck assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377280)
