A minimum-cost multicommodity network flow problem concerning imports and exports

DOI10.1002/NET.3230050404zbMATH Open0326.90063OpenAlexW2006684039MaRDI QIDQ4091734FDOQ4091734

Authors: Bruce Golden 

Publication date: 1975

Published in: Networks (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Renewal theory (60K05) Trade models (91B60)

Cites Work

• Title not available (Why is that?)
• A nonlinear programming technique for the optimization of continuous processing systems
• Title not available (Why is that?)
• A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
• A partitioning algorithm for the multicommodity network flow problem

Cited In (3)

• Equilibria on a Congested Transportation Network
• An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints
• Multicommodity network flows: a survey. I: Applications and formulations

This page was built for publication: A minimum-cost multicommodity network flow problem concerning imports and exports

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