TY - JOUR
T1 - Computational studies of randomized multidimensional assignment problems
AU - Mirghorbani, Mohammad
AU - Krokhmal, Pavlo
AU - Pasiliao, Eduardo L.
PY - 2012
Y1 - 2012
N2 - In this chapter, we consider a class of combinatorial optimization problems on hypergraph matchings that represent multidimensional generalizations of the well-known linear assignment problem (LAP). We present two algorithms for solving randomized instances of MAPs with linear and bottleneck objectives that obtain solutions with guaranteed quality.
AB - In this chapter, we consider a class of combinatorial optimization problems on hypergraph matchings that represent multidimensional generalizations of the well-known linear assignment problem (LAP). We present two algorithms for solving randomized instances of MAPs with linear and bottleneck objectives that obtain solutions with guaranteed quality.
KW - Hypergraph matching problem
KW - Multidimensional assignment problem
KW - Probabilistic analysis
UR - http://www.scopus.com/inward/record.url?scp=84892689794&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84892689794&partnerID=8YFLogxK
U2 - 10.1007/978-1-4614-3906-6_12
DO - 10.1007/978-1-4614-3906-6_12
M3 - Article
AN - SCOPUS:84892689794
SN - 2194-1009
VL - 20
SP - 225
EP - 244
JO - Springer Proceedings in Mathematics and Statistics
JF - Springer Proceedings in Mathematics and Statistics
ER -