Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision

DOI10.1007/978-3-642-02026-1_1zbMath1246.90059OpenAlexW1483588325MaRDI QIDQ3637045

Jianping Li, Weidong Li, Jianbo Li

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_1

zbMATH Keywords

schedulingallocationgrade of servicepolynomial time approximation schemefully polynomial time approximation scheme

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision