The assignment problem
From MaRDI portal
Recommendations
- An assignment problem
- The assignment problem revisited
- scientific article; zbMATH DE number 176471
- A variation of the assignment problem
- scientific article; zbMATH DE number 841607
- An algorithm for the assignment problem
- scientific article; zbMATH DE number 3972644
- On solving a variation of the assignment problem
- The generalized assignment problem
- scientific article; zbMATH DE number 3918100
Cites work
- A new solution of Dijkstra's concurrent programming problem
- Asynchronous coordination under preferences and constraints
- At-Most-Once Semantics in Asynchronous Shared Memory
- Atomic snapshots of shared memory
- Efficient parallel algorithms can be made robust
- Immediate atomic snapshots and fast renaming
- Musical Chairs
- Myths about the mutual exclusion problem
- On interprocess communication. II: Algorithms
- Performing Work Efficiently in the Presence of Faults
- Renaming in an asynchronous environment
- Solving the at-most-once problem with nearly optimal effectiveness
- The Instancy of Snapshots and Commuting Objects
- The PlusCal Algorithm Language
- The strong at-most-once problem
- Wait-free algorithms for fast, long-lived renaming
Cited in
(10)- When Is the Classroom Assignment Problem Hard?
- The stable crews problem
- scientific article; zbMATH DE number 147743 (Why is no real title available?)
- scientific article; zbMATH DE number 1084188 (Why is no real title available?)
- Principles of Distributed Systems
- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
- The scholarship assignment problem
- ON A PERSONNEL ASSIGNMENT PROBLEM
- Solving assignment problems using best job method
- scientific article; zbMATH DE number 1357934 (Why is no real title available?)
This page was built for publication: The assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232588)