Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems

DOI10.1007/978-3-540-72792-7_21MaRDI QIDQ5429273zbMATH OpenOpenAlexFDO

Authors Toshinari Itoko, Satoru Iwata

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_21

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Queues and service in operations research (90B22) Combinatorial optimization (90C27)

Recommendations

• Computational geometric approach to submodular function minimization for multiclass queueing systems
• Submodular function minimization
• A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
• A faster strongly polynomial time algorithm for submodular function minimization

Cited in

(2)

• Computational geometric approach to submodular function minimization for multiclass queueing systems
• Sequence independent lifting for a set of submodular maximization problems

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 Q5429273)