scientific article; zbMATH DE number 910865

From MaRDI portal

Publication:4886039

Jump to:navigation, search

zbMath0862.90111MaRDI QIDQ4886039

Chung-Piaw Teo, Dimitris J. Bertsimas

Publication date: 22 August 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stochastic scheduling valid inequalities set covering network design approximation algorithms vertex cover cyclic scheduling covering problems totally balanced matrices worst-case bound multiarmed bandits optimal control of queueing systems intersections of polymatroids primal-dual framework

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

On approximation of the submodular set cover problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4886039&oldid=19258882"