A multiperiod min-sum arborescence problem

DOI10.1007/S12597-013-0165-YzbMath1332.90050OpenAlexW1981177952MaRDI QIDQ260662

Rakesh Kawatra

Publication date: 22 March 2016

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-013-0165-y

zbMATH Keywords

optimizationheuristicsinteger programmingnetwork designmultiperiod networks

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• A multiperiod degree constrained minimal spanning tree problem
• A multiperiod planning model for the capacitated minimal spanning tree problem
• An Oil Pipeline Design Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Finding optimum branchings
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
• Validation of subgradient optimization
• Optimum branchings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A multiperiod min-sum arborescence problem