An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
From MaRDI portal
Cited in
(19)- Multicommodity network flows: A survey. II: Solution methods
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- A polynomially bounded algorithm for a singly constrained quadratic program
- A generalization of Polyak's convergence result for subgradient optimization
- A hybrid algorithm for solving network flow problems with side constraints.
- Heuristic methods and applications: A categorized survey
- Conditional subgradient optimization -- theory and applications
- Solving a class of network models for dynamic flow control
- A polynomial algorithm for minimum quadratic cost flow problems
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Network topology and integral multicommodity flow problems
- A library for continuous convex separable quadratic knapsack problems
- Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- A survey on the continuous nonlinear resource allocation problem
- An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in R^n
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
- Reoptimization procedures for bounded variable primal simplex network algorithms
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
This page was built for publication: An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4143047)
