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

DOI10.1016/J.ORL.2006.02.005zbMATH Open1149.90415OpenAlexW4298028952MaRDI QIDQ2643798FDOQ2643798

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

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

zbMATH Keywords

cycle-cancelling algorithmnon-convex multicommodity flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

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

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)