Relaxation Methods for Network Flow Problems with Convex Arc Costs
From MaRDI portal
Recommendations
- An \epsilon-Relaxation Method for Separable Convex Cost Network Flow Problems
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
- Parallel algorithms for solving the convex minimum cost flow problem
- The partitioned -relaxation algorithm for separable convex network flow problems
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
Cited in
(40)- Dual coordinate step methods for linear network flow problems
- Decomposition algorithm for convex differentiable minimization
- On the dual coordinate ascent approach for nonlinear networks
- The partitioned -relaxation algorithm for separable convex network flow problems
- The auction algorithm: A distributed relaxation method for the assignment problem
- Descent methods for convex essentially smooth minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- A unified description of iterative algorithms for traffic equilibria
- Data parallel computing for network-structured optimization problems
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
- Convexification of generalized network flow problem
- Asynchronous gradient algorithms for a class of convex separable network flow problems
- Network games; adaptations to Nash-Cournot equilibrium
- Solving multistage stochastic network programs on massively prallel computers
- Application of the dual active set algorithm to quadratic network optimization
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
- A survey on the continuous nonlinear resource allocation problem
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- scientific article; zbMATH DE number 4102839 (Why is no real title available?)
- A partial linearization method for the traffic assignment problem
- An -relaxation method for generalized separable convex cost network flow problems
- About saddle values of a class of convex-concave functions
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- Multicommodity network flows: A survey. II: Solution methods
- On the linear convergence of the alternating direction method of multipliers
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- A generalized multi-parameterized proximal point algorithm for linearly constrained convex optimization problem
- Relaxation methods for monotropic programs
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
- A survey of dynamic network flows
- Models for multimode multicommodity location problems with interdepot balancing requirements
- A combinatorial arc tolerance analysis for network flow problems
This page was built for publication: Relaxation Methods for Network Flow Problems with Convex Arc Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783055)
