The -assignment problems
From MaRDI portal
The \(\beta\)-assignment problems
Recommendations
Cites work
- Bottleneck extrema
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- Minimum partition of a matroid into independent subsets
- On a scheduling problem where a job can be executed only by a limited number of processors
Cited in
(12)- Persistency in the assignment and transportation problems
- Algorithms for finding a \(K\)th best valued assignment
- The \(\beta\)-assignment problem in general graphs
- An algorithm for fractional assignment problems
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- Computing the sequence of k-cardinality assignments
- Distributed balanced color assignment on arbitrary networks
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- scientific article; zbMATH DE number 4081306 (Why is no real title available?)
- scientific article; zbMATH DE number 1084188 (Why is no real title available?)
- Assignment problems: a golden anniversary survey
- Incremental assignment problem
This page was built for publication: The \(\beta\)-assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291693)