Two kinds of constrained assignment problems

MaRDI QIDQ3110856zbMATH OpenFDO

Authors

Publication date 27 January 2012

zbMATH Keywords

absent assignment problemassignment problemBellman-Ford algorithmsemi-matching

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• The constrained minimax linear assignment problem
• scientific article; zbMATH DE number 33840
• Efficient dual simplex algorithms for the assignment problem
• scientific article; zbMATH DE number 3989103
• The assignment problem with seniority and job priority constraints

Cited in

(9)

• Between a rock and a hard place: the two-to-one assignment problem
• Assignment problem with conflicts
• The assignment problem with seniority and job priority constraints
• scientific article; zbMATH DE number 30946 (Why is no real title available?)
• scientific article; zbMATH DE number 33840 (Why is no real title available?)
• scientific article; zbMATH DE number 1090084 (Why is no real title available?)
• scientific article; zbMATH DE number 1487886 (Why is no real title available?)
• The constrained minimax linear assignment problem
• Distribution of assignments among participants under conditions of constraints

This page was built for publication: Two kinds of constrained assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110856)