scientific article; zbMATH DE number 611144

MaRDI QIDQ4298395zbMATH OpenFDO

Authors Carlos jun. Humes

Publication date 1992

zbMATH Keywords

computer network designfeasible directionsflow assignmentcontinuous capacitydouble-projection method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• A heuristic for the continuous capacity and flow assignment
• A restriction and feasible direction algorithm for a capacity expansion problem
• Bounds for global optimization of capacity expansion and flow assignment problems
• A capacity scaling algorithm for the constrained maximum flow problem
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• An optimal capacity assignment for the robust design problem in capacitated flow networks
• On a capacity scaling algorithm for the constrained maximum flow problem
• Finding flow equilibrium with projective methods with decomposition and route generation
• Projecting the flow variables for hub location problems
• An Approximation for a Continuous Max-Flow Problem

Cited in

(3)

• The projected pairwise multicommodity flow polyhedron
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• A heuristic for the continuous capacity and flow assignment

This page was built for publication:

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