Some recent contributions to network optimization

DOI10.1002/net.20010zbMath1103.90023OpenAlexW2034028508MaRDI QIDQ4812397

Walid Ben-Ameur, Luís Gouveia

Publication date: 20 August 2004

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

uncertaintyreliabilitywireless communicationsgraphsmathematical programmingtreesnetwork designpricingsurvivabilitynetwork optimizationrouting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
• Design of survivable networks
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• A note on the parametric maximum flow problem and some related reoptimization issues

This page was built for publication: Some recent contributions to network optimization