Further contributions to network optimization

DOI10.1002/NET.20113MaRDI QIDQ5487817zbMATH OpenOpenAlexFDO

Authors Walid Ben-Ameur, Luis Gouveia

Publication date 12 September 2006

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

graphsmathematical programmingreliabilityinteger programmingsurvivabilityshortest path routingnetwork optimization, network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cites work

• Combined route capacity and route length models for unit demand vehicle routing problems
• Computing the initial temperature of simulated annealing
• Distributed computation on graphs
• Generalized domino-parity inequalities for the symmetric traveling salesman problem
• Hardness of robust network design
• Hop-constrained node survivable network design: An application to MPLS over WDM
• Linear time algorithms for approximating the facility terminal cover problem
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Network design arc set with variable upper bounds
• On column generation formulations for the RWA problem
• On the minimum path problem in Knödel graphs
• Reduction tests for the prize-collecting Steiner problem
• Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

Cited in

(1)

• Some recent contributions to network optimization

This page was built for publication: Further contributions to network optimization

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