Multiple bottleneck assignment problem
From MaRDI portal
Publication:1806893
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- Bottleneck assignment problems under categorization
- Categorized Assignment Scheduling: a Tabu Search Approach
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Minimum perfect bipartite matchings and spanning trees under categorization
- On combined minmax-minsum optimization
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Some Generalisations of the Time Minimising Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The multiple bottleneck transportation problem
Cited in
(13)- Optimal improvements in bottleneck systems
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- Bottleneck assignment problems under categorization
- Integer programming models for the multidimensional assignment problem with star costs
- On bottleneck assignment problems under categorization.
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
- The Multicommodity Multilevel Bottleneck Assignment Problem
- The three-dimensional bottleneck assignment problem with capacity constraints
- Assignment problems: a golden anniversary survey
- Approximating the multi-level bottleneck assignment problem
- Approximating the multi-level bottleneck assignment problem
- scientific article; zbMATH DE number 4139475 (Why is no real title available?)
This page was built for publication: Multiple bottleneck assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806893)