Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs

DOI10.1002/NET.20208MaRDI QIDQ5449668zbMATH OpenOpenAlexFDO

Authors Maurício C. de Souza, Philippe Mahey, Bernard Gendron

Publication date 12 March 2008

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

cycle canceling algorithmsmulticommodity flow problemstabu search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Cites work

• Backbone Network Design Tools with Economic Tradeoffs
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(8)

• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
• Engineering Negative Cycle Canceling for Wind Farm Cabling
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A conic quadratic formulation for a class of convex congestion functions in network flow problems

This page was built for publication: Cycle‐based algorithms for multicommodity network 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 Q5449668)