Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines

Maxim Sviridenko, Andreas Wiese

Research output: Chapter in Book / Report / Conference proceeding › Chapter › Academic › peer-review

Original language	Undefined/Unknown
Title of host publication	Integer Programming and Combinatorial Optimization (IPCO 2013)
Publisher	Springer
Pages	387-398
Number of pages	12
Volume	7801
ISBN (Print)	978-3-642-36693-2
DOIs	https://doi.org/10.1007/978-3-642-36694-9_33
Publication status	Published - 2013
Externally published	Yes

Name	Lecture Notes in Computer Science
Publisher	Springer

Access to Document

@inbook{2f8fdca303584d3cbd308400588772ca,

title = "Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines",

author = "Maxim Sviridenko and Andreas Wiese",

year = "2013",

doi = "10.1007/978-3-642-36694-9_33",

language = "Undefined/Unknown",

isbn = "978-3-642-36693-2",

volume = "7801",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "387--398",

booktitle = "Integer Programming and Combinatorial Optimization (IPCO 2013)",

}

Integer Programming and Combinatorial Optimization (IPCO 2013). Vol. 7801 Springer, 2013. p. 387-398 (Lecture Notes in Computer Science).

Research output: Chapter in Book / Report / Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines

AU - Sviridenko, Maxim

AU - Wiese, Andreas

PY - 2013

Y1 - 2013

U2 - 10.1007/978-3-642-36694-9_33

DO - 10.1007/978-3-642-36694-9_33

M3 - Chapter

SN - 978-3-642-36693-2

VL - 7801

T3 - Lecture Notes in Computer Science

SP - 387

EP - 398

BT - Integer Programming and Combinatorial Optimization (IPCO 2013)

PB - Springer

ER -