The capacity formulation of the capacitated edge activation problem

DOI10.1002/NET.21797MaRDI QIDQ4584869zbMATH OpenOpenAlexFDO

Authors Sara Mattia

Publication date 4 September 2018

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

sensitivity analysisfacetsnetwork designBenders decompositioncapacity formulationsplittable flowsunsplittable flowsenergy-aware networking

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• A polyhedral analysis of the capacitated edge activation problem with uncertain demands
• Approximating activation edge-cover and facility location problems
• Approximating activation edge-cover and facility location problems
• A min-edge cost flow framework for capacitated covering problems
• Edge capacity augmentation problem on spanning trees in networks
• On the edge capacitated Steiner tree problem
• scientific article; zbMATH DE number 1353813
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• On the extremal solutions for capacitated network problems

Cited in

(2)

• A polyhedral analysis of the capacitated edge activation problem with uncertain demands
• Benders decomposition for capacitated network design

This page was built for publication: The capacity formulation of the capacitated edge activation problem

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