The -assignment problems

DOI10.1016/S0377-2217(97)00008-8MaRDI QIDQ1291693zbMATH OpenFDO

Authors Pei-Hsin Ho, Gerard Jennhwa Chang

Publication date 22 February 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

assignmentlabelbottleneckaugmentation path

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• The \(\beta\)-assignment problem in general graphs
• An algorithm for fractional assignment problems
• scientific article; zbMATH DE number 515939
• Optimum matchings in weighted bipartite graphs

Cites work

• 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?)
• Bottleneck extrema
• 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

(10)

• Assignment problems: a golden anniversary survey
• Incremental assignment problem
• scientific article; zbMATH DE number 4081306 (Why is no real title available?)
• scientific article; zbMATH DE number 1084188 (Why is no real title available?)
• Computing the sequence of \(k\)-cardinality assignments
• Algorithms for finding a \(K\)th best valued assignment
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
• Distributed balanced color assignment on arbitrary networks
• The \(\beta\)-assignment problem in general graphs
• Competitive strategies for an online generalized assignment problem with a service consecution constraint

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)