An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems

DOI10.1287/mnsc.23.9.994zbMath0366.90118OpenAlexW2044678318MaRDI QIDQ4143047

No author found.

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.9.994

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items

Solving a class of network models for dynamic flow control, A generalization of Polyak's convergence result for subgradient optimization, A hybrid algorithm for solving network flow problems with side constraints., An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\), Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm, An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Unnamed Item, A survey on the continuous nonlinear resource allocation problem, Network topology and integral multicommodity flow problems, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Conditional subgradient optimization -- theory and applications, A polynomially bounded algorithm for a singly constrained quadratic program, A polynomial algorithm for minimum quadratic cost flow problems, Heuristic methods and applications: A categorized survey, Reoptimization procedures for bounded variable primal simplex network algorithms, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, A library for continuous convex separable quadratic knapsack problems