An exact algorithm for the min-cost network containment problem

DOI10.1002/NET.10106zbMATH Open1069.68650OpenAlexW1972290932MaRDI QIDQ4458721FDOQ4458721

Authors: Raffaele Pesenti, Franca Rinaldi, Walter Ukovich 

Publication date: 15 March 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10106

Recommendations

• Network design problem with cut constraints
• scientific article; zbMATH DE number 3882168
• Capacitated Network Design—Polyhedral Structure and Computation
• A composite algorithm for a concave-cost network flow problem
• Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints

zbMATH Keywords

network designmax weight directed cutpolyhedra containment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Single-commodity robust network design with finite and hose demand sets
• An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions

This page was built for publication: An exact algorithm for the min-cost network containment problem

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