A Parallel Projection for the Multicommodity Network Model

DOI10.1057/jors.1990.121zbMath0711.90021OpenAlexW2063060116MaRDI QIDQ3496126

R. Muthukrishnan, Bala Shetty

Publication date: 1990

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1990.121

zbMATH Keywords

multicommodity problemsresource-directive decomposition method

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Distributed algorithms (68W15)

Related Items (15)

Decision model and analysis for investment interest expense deduction and allocation ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Quadratic resource allocation with generalized upper bounds ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints ⋮ Unnamed Item ⋮ Variable fixing algorithms for the continuous quadratic Knapsack problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Breakpoint searching algorithms for the continuous quadratic knapsack problem ⋮ A relaxed projection method for general integer quadratic knapsack problem. ⋮ A pegging algorithm for the nonlinear resource allocation problem ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ The nonlinear knapsack problem - algorithms and applications ⋮ An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem

This page was built for publication: A Parallel Projection for the Multicommodity Network Model