A survey of algorithms for convex multicommodity flow problems
From MaRDI portal
Recommendations
Cited in
(44)- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Bounds for global optimization of capacity expansion and flow assignment problems
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Heterogeneous flow distribution at the peak load in the multiuser network
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- A class of alternating linearization algorithms for nonsmooth convex optimization
- Primal convergence from dual subgradient methods for convex optimization
- Maximum flow under proportional delay constraint
- Approximate methods for convex minimization problems with series-parallel structure
- A bundle-type algorithm for routing in telecommunication data networks
- Large-scale optimization with the primal-dual column generation method
- A decomposition method for solving multicommodity network equilibria
- Separable convexification and DCA techniques for capacity and flow assignment problems.
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Robust network design with uncertain outsourcing cost
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- On methods for the convex multi-commodity flow problem
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
- scientific article; zbMATH DE number 4033461 (Why is no real title available?)
- scientific article; zbMATH DE number 1157097 (Why is no real title available?)
- Multicommodity network flows: a survey. I: Applications and formulations
- Multicommodity network flows: A survey. II: Solution methods
- Decomposition methods for a spatial model for long-term energy pricing problem
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Approximation and Online Algorithms
- The omnipresence of Lagrange
- 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
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Implementation of an oracle-structured bundle method for distributed optimization
- Distributionally robust chance-constrained multicommodity network flow problem in dynamic networks: a column-generation approach
- High-accuracy multicommodity flows via iterative refinement
- Underground freight transportation for package delivery in urban environments
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem
- A two-stage stochastic programming model for transportation network protection
This page was built for publication: A survey of algorithms for convex multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116724)
