Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

DOI10.3138/infor.48.1.013OpenAlexW2053168728MaRDI QIDQ6160230

Dalila B. M. M. Fontes

Publication date: 9 May 2023

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3138/infor.48.1.013

zbMATH Keywords

dynamic programmingnetwork flowsgeneral nonlinear costshop-constrained trees

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items

The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hop constrained min-sum arborescence with outage costs
• Multicommodity flow models for spanning trees with hop constraints
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Packet reordering in networks with heavy-tailed delays
• A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
• Analysis of a flow problem with fixed charges
• Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
• A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem