Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

DOI10.1016/J.ORL.2006.02.005MaRDI QIDQ2643798zbMATH OpenOpenAlexFDO

Authors Philippe Mahey, Maurício C. de Souza

Publication date 27 August 2007

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2006.02.005

zbMATH Keywords

cycle-cancelling algorithmnon-convex multicommodity flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• Network optimization with piecewise linear convex costs
• Optimal Two-commodity Flows with Non-linear Cost Functions
• Monotonicity and conformality in multicommodity network‐flow problems
• A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• A Primal Algorithm to Solve Network Flow Problems with Convex Costs
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• Bounds for global optimization of capacity expansion and flow assignment problems
• Network flows. Theory, algorithms, and applications.
• Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
• Solving integer minimum cost flows with separable convex cost objective polynomially

Cited in

(2)

• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• A conic quadratic formulation for a class of convex congestion functions in network flow problems

This page was built for publication: Local optimality conditions for multicommodity flow problems with separable piecewise convex costs

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