Pages that link to "Item:Q3116724"
From MaRDI portal
The following pages link to A Survey of Algorithms for Convex Multicommodity Flow Problems (Q3116724):
Displayed 33 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- Decomposition methods for a spatial model for long-term energy pricing problem (Q522102) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Quadratic regularizations in an interior-point method for primal block-angular problems (Q652285) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming (Q850824) (← links)
- A multi-start variable neighborhood search for solving the single path multicommodity flow problem (Q902982) (← links)
- A two-stage stochastic programming model for transportation network protection (Q960408) (← links)
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
- Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Heterogeneous flow distribution at the peak load in the multiuser network (Q2171298) (← links)
- Algorithms for an integer multicommodity network flow problem with node reliability considerations (Q2247900) (← links)
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
- A class of alternating linearization algorithms for nonsmooth convex optimization (Q2316308) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Maximum flow under proportional delay constraint (Q2402261) (← links)
- Approximate methods for convex minimization problems with series-parallel structure (Q2482762) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Robust Network Design with Uncertain Outsourcing Cost (Q3458750) (← links)
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION (Q3636562) (← links)
- (Q5020878) (← links)
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem (Q6070981) (← links)