Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

DOI10.3138/INFOR.48.1.013OpenAlexW2053168728MaRDI QIDQ6160230FDOQ6160230

Authors: 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)

Cites Work

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

Cited In (4)

• The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
• Tree embeddings for hop-constrained network design
• Title not available (Why is that?)
• A network flow approach to cost allocation for rooted trees

This page was built for publication: Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks

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