A Survey of Algorithms for Convex Multicommodity Flow Problems
From MaRDI portal
Publication:3116724
DOI10.1287/mnsc.46.1.126.15132zbMath1231.90110OpenAlexW2140409200MaRDI QIDQ3116724
Philippe Mahey, Jean-Philippe Vial, Adam Ouorou
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a374d6779ec668d9a0c862b571e419dbc644bdb2
Related Items
Large-scale optimization with the primal-dual column generation method, Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, Robust Network Design with Uncertain Outsourcing Cost, Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming, A bundle-type algorithm for routing in telecommunication data networks, The proximal Chebychev center cutting plane algorithm for convex additive functions, Maximum flow under proportional delay constraint, Heterogeneous flow distribution at the peak load in the multiuser network, A decomposition method for solving multicommodity network equilibria, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem, A multi-start variable neighborhood search for solving the single path multicommodity flow problem, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, Unnamed Item, Quadratic regularizations in an interior-point method for primal block-angular problems, A minimum mean cycle cancelling method for nonlinear multicommodity flow problems, Algorithms for an integer multicommodity network flow problem with node reliability considerations, Decomposition methods for a spatial model for long-term energy pricing problem, A two-stage stochastic programming model for transportation network protection, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, Approximate methods for convex minimization problems with series-parallel structure, Separable convexification and DCA techniques for capacity and flow assignment problems, A conic quadratic formulation for a class of convex congestion functions in network flow problems, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, The omnipresence of Lagrange, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, A class of alternating linearization algorithms for nonsmooth convex optimization, Bounds for global optimization of capacity expansion and flow assignment problems, Primal convergence from dual subgradient methods for convex optimization
