The aggregate capacity of virtual resources – linear models

DOI10.1080/02331934.2012.678355MaRDI QIDQ5169447zbMATH OpenOpenAlexFDO

Authors Jean-Paul Bourrieres

Publication date 10 July 2014

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2012.678355

zbMATH Keywords

aggregate capacityMinkowski sumpiecewise linear constraintsvirtual resource

Mathematics Subject Classification ID

Polyhedral manifolds (52B70) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Models for determination of total capacity in computer and communicating systems
• Synchronous resource allocation: modeling, capacity, and optimization
• On the throughput of a resource sharing model.
• On a storage allocation model with finite capacity
• On the optimal allocation of virtual resources in cloud computing networks

Cites work

• \(f\)-vectors of Minkowski additions of convex polytopes
• A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
• A multi-level technical data model for production planning
• An LP-aggregation view on aggregation in multi-level production planning
• Cephoids: Minkowski sums of de Gua simplexes
• Combinatorial face enumeration in convex polytopes
• Computing the Minkowski sum of prisms
• Convex polytopes and enumeration
• Easily Computable Facets of the Knapsack Polytope
• Inner and outer approximations of polytopes using boxes.
• On Minkowski sums of simplices
• On simple polytopes
• On the number of faces of certain transportation polytopes
• Optimal virtual cluster-based multiprocessor scheduling
• The number of faces of a simplicial convex polytope
• The numbers of faces of simplicial polytopes

This page was built for publication: The aggregate capacity of virtual resources – linear models

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