A conic quadratic formulation for a class of convex congestion functions in network flow problems
DOI10.1016/J.EJOR.2010.12.018zbMATH Open1250.90022OpenAlexW2126984548MaRDI QIDQ713098FDOQ713098
Authors: 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
Recommendations
- Convexification of generalized network flow problem
- A concavity result for network design problems
- An Integral Inequality for Convex Functions, with Application to Teletraffic Congestion Problems
- Convexification of queueing formulas by mixed-integer second-order cone programming: an application to a discrete location problem with congestion
- A branch-and-bound algorithm for concave network flow problems
- New formulation and relaxation to solve a concave-cost network flow problem
- A polynomial time solvable concave network flow problem
- Publication:4938773
- On minimum concave cost network flow problems
- scientific article; zbMATH DE number 2068072
network flowsinteger programmingcapacity expansionsecond-order cone programmingcongestion costsconvex increasing power functions
Convex programming (90C25) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Second-order cone programming
- Projected perspective reformulations with applications in design problems
- A survey of algorithms for convex multicommodity flow problems
- Capacity and flow assignment of data networks by generalized Benders decomposition
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Conic mixed-integer rounding cuts
- A GRASP with path-relinking for private virtual circuit routing
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Lifting for conic mixed-integer programming
- Bounds for global optimization of capacity expansion and flow assignment problems
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs
Cited In (2)
This page was built for publication: A conic quadratic formulation for a class of convex congestion functions in network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713098)
