scientific article; zbMATH DE number 910865

zbMATH Open0862.90111MaRDI QIDQ4886039FDOQ4886039

Authors: Chung-Piaw Teo, Dimitris Bertsimas 

Publication date: 22 August 1996

Title of this publication is not available (Why is that?)

Recommendations

• From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
• Primal-dual schema for capacitated covering problems
• Primal-Dual Schema for Capacitated Covering Problems
• Rounding algorithms for covering problems
• Automata, Languages and Programming

zbMATH Keywords

approximation algorithmsnetwork designvertex coverset coveringvalid inequalitiescyclic schedulingstochastic schedulingcovering problemstotally balanced matricesworst-case boundmultiarmed banditsoptimal control of queueing systemsintersections of polymatroidsprimal-dual framework

Mathematics Subject Classification ID

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

Cited In (7)

• A water-filling primal-dual algorithm for approximating nonlinear covering problems
• Primal-dual schema for capacitated covering problems
• On approximation of the submodular set cover problem
• From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
• Title not available (Why is that?)
• Primal-Dual Schema for Capacitated Covering Problems
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP

This page was built for publication:

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