Coupled and k-Sided Placements: Generalizing Generalized Assignment

DOI10.1007/978-3-319-07557-0_30MaRDI QIDQ5419009zbMATH OpenOpenAlexFDO

Authors Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku

Publication date 2 June 2014

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07557-0_30

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Coupled and \(k\)-sided placements: generalizing generalized assignment
• (1,k)-configuration facets for the generalized assignment problem
• The generalized assignment problem: Valid inequalities and facets
• Stable assignment with couples: parameterized complexity and local search
• Stable assignment with couples: parameterized complexity and local search
• The generalized assignment problem
• scientific article; zbMATH DE number 3918100
• An efficient approximation for the generalized assignment problem

Cited in

(3)

• Colocating tasks in data centers using a side-effects performance model
• Core group placement: allocation and provisioning of heterogeneous resources
• Coupled and \(k\)-sided placements: generalizing generalized assignment

This page was built for publication: Coupled and k-Sided Placements: Generalizing Generalized Assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419009)