The aggregate capacity of virtual resources – linear models
From MaRDI portal
Publication:5169447
DOI10.1080/02331934.2012.678355zbMath1291.91142OpenAlexW2020357688MaRDI QIDQ5169447
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
Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Polyhedral manifolds (52B70)
Cites Work
- On Minkowski sums of simplices
- Convex polytopes and enumeration
- A multi-level technical data model for production planning
- Optimal virtual cluster-based multiprocessor scheduling
- The number of faces of a simplicial convex polytope
- An LP-aggregation view on aggregation in multi-level production planning
- On simple polytopes
- Combinatorial face enumeration in convex polytopes
- Inner and outer approximations of polytopes using boxes.
- On the number of faces of certain transportation polytopes
- \(f\)-vectors of Minkowski additions of convex polytopes
- Computing the Minkowski sum of prisms
- The numbers of faces of simplicial polytopes
- Easily Computable Facets of the Knapsack Polytope
- Cephoids: Minkowski sums of de Gua simplexes
- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
This page was built for publication: The aggregate capacity of virtual resources – linear models
