A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design

DOI10.1007/978-3-642-22616-8_41zbMATH Open1342.68359OpenAlexW2034108256MaRDI QIDQ5199176

Peng Zhang

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_41

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (2)

A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design ⋮ Title not available (Why is that?)

This page was built for publication: A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design

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