Computational studies of randomized multidimensional assignment problems

Mohammad Mirghorbani; Pavlo Krokhmal; Eduardo L. Pasiliao

doi:10.1007/978-1-4614-3906-6_12

Computational studies of randomized multidimensional assignment problems

Mohammad Mirghorbani, Pavlo Krokhmal, Eduardo L. Pasiliao

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	225-244
Number of pages	20
Journal	Springer Proceedings in Mathematics and Statistics
Volume	20
DOIs	https://doi.org/10.1007/978-1-4614-3906-6_12
State	Published - 2012
Externally published	Yes

Keywords

Hypergraph matching problem
Multidimensional assignment problem
Probabilistic analysis

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/978-1-4614-3906-6_12

Cite this

@article{5937f877e2a04047bc48af501bede5d0,

title = "Computational studies of randomized multidimensional assignment problems",

abstract = "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.",

keywords = "Hypergraph matching problem, Multidimensional assignment problem, Probabilistic analysis",

author = "Mohammad Mirghorbani and Pavlo Krokhmal and Pasiliao, \{Eduardo L.\}",

year = "2012",

doi = "10.1007/978-1-4614-3906-6\_12",

language = "English (US)",

volume = "20",

pages = "225--244",

journal = "Springer Proceedings in Mathematics and Statistics",

issn = "2194-1009",

publisher = "Springer",

}

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 - https://www.scopus.com/pages/publications/84892689794

UR - https://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 -

Computational studies of randomized multidimensional assignment problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this