A conic quadratic formulation for a class of convex congestion functions in network flow problems

DOI10.1016/j.ejor.2010.12.018zbMath1250.90022OpenAlexW2126984548MaRDI QIDQ713098

Sinan Gürel

Publication date: 26 October 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.12.018

zbMATH Keywords

integer programmingnetwork flowscapacity expansionsecond-order cone programmingcongestion costsconvex increasing power functions

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Cites Work

• Lifting for conic mixed-integer programming
• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Conic mixed-integer rounding cuts
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• Second-order cone programming
• Bounds for global optimization of capacity expansion and flow assignment problems
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
• Lectures on Modern Convex Optimization
• Projected Perspective Reformulations with Applications in Design Problems
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• A GRASP with path-relinking for private virtual circuit routing
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• Capacity and flow assignment of data networks by generalized Benders decomposition

This page was built for publication: A conic quadratic formulation for a class of convex congestion functions in network flow problems