The \(\beta\)-assignment problems

DOI10.1016/S0377-2217(97)00008-8zbMath0955.90064MaRDI QIDQ1291693

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

bottleneckassignmentlabelaugmentation path

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Assignment problems: a golden anniversary survey, Distributed balanced color assignment on arbitrary networks, Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming, Competitive strategies for an online generalized assignment problem with a service consecution constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a scheduling problem where a job can be executed only by a limited number of processors
• Minimum partition of a matroid into independent subsets
• Bottleneck extrema