Computational geometric approach to submodular function minimization for multiclass queueing systems

DOI10.1007/s13160-012-0074-0zbMath1283.68112OpenAlexW1964707479MaRDI QIDQ1926646

Toshinari Itoko, Satoru Iwata

Publication date: 28 December 2012

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-012-0074-0

zbMATH Keywords

submodular functionzonotopearrangementmulticlass queue

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

Submodular function minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A faster strongly polynomial time algorithm for submodular function minimization
• Topologically sweeping an arrangement
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Submodular functions and optimization.
• Corrigendum: Topologically sweeping an arrangement
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• Performance bounds for queueing networks and scheduling policies
• Lectures on Polytopes
• The Achievable Region Approach to the Optimal Control of Stochastic Systems

This page was built for publication: Computational geometric approach to submodular function minimization for multiclass queueing systems