A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem

DOI10.1002/NET.21721MaRDI QIDQ4565776zbMATH OpenOpenAlexWikidataFDO

Authors Bernard Fortz, E. Gorgone, Dimitri Papadimitriou

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

mixed integer programmingnetwork designroutingLagrangian decompositiontelecommunications networksmulticommodity fixed-charge network design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• scientific article; zbMATH DE number 1187079
• scientific article; zbMATH DE number 1264406
• Topological design of computer communication networks -- the overall design problem

Cited in

(11)

• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• Models for the piecewise linear unsplittable multicommodity flow problems
• Some approaches to solving a multihour broadband network capacity design problem with single-path routing
• Lagrangian relaxation for SVM feature selection
• scientific article; zbMATH DE number 1187079 (Why is no real title available?)
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
• Multicommodity information flow through quantum annealer
• Model of optimal paths design for GMPLS network and algorithm based on Lagrangian relaxation method
• A Lagrangian approach to chance constrained routing with local broadcast
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound
• A meta-heuristic extension of the Lagrangian heuristic framework

This page was built for publication: A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem

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