Computational geometric approach to submodular function minimization for multiclass queueing systems

DOI10.1007/S13160-012-0074-0MaRDI QIDQ1926646zbMATH OpenOpenAlexFDO

Authors 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 functionarrangementzonotopemulticlass queue

Mathematics Subject Classification ID

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

Recommendations

• Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
• A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
• A faster strongly polynomial time algorithm for submodular function minimization
• Submodular function minimization

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3761395 (Why is no real title available?)
• scientific article; zbMATH DE number 1926667 (Why is no real title available?)
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A faster strongly polynomial time algorithm for submodular function minimization
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• Corrigendum: Topologically sweeping an arrangement
• Geometric algorithms and combinatorial optimization
• Lectures on Polytopes
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• Performance bounds for queueing networks and scheduling policies
• Submodular function minimization
• Submodular functions and optimization.
• The Achievable Region Approach to the Optimal Control of Stochastic Systems
• The ellipsoid method and its consequences in combinatorial optimization
• Topologically sweeping an arrangement

Cited in

(3)

• Submodular function minimization
• Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
• A normal fan projection algorithm for low-rank optimization

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

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