A Parallel Projection for the Multicommodity Network Model

DOI10.1057/JORS.1990.121MaRDI QIDQ3496126zbMATH OpenOpenAlexFDO

Authors Bala Shetty, R. Muthukrishnan

Publication date 1990

Published in The 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

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

Recommendations

• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Computational experience with a parallel implementation of an interior-point algorithm for multicommodity network flows
• scientific article; zbMATH DE number 2080144

Cited in

(19)

• Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
• Quadratic resource allocation with generalized upper bounds
• The nonlinear knapsack problem - algorithms and applications
• Variable fixing method by weighted average for the continuous quadratic knapsack problem
• Decision model and analysis for investment interest expense deduction and allocation
• 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.
• Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multicommodity flow problems
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• On the Fine-Grain Decomposition of Multicommodity Transportation Problems
• Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
• Multicommodity network flows: A survey. II: Solution methods
• An efficient hybrid algorithm for the separable convex quadratic knapsack problem
• A pegging algorithm for the nonlinear resource allocation problem
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
• A Newton's method for the continuous quadratic knapsack problem
• Variable fixing algorithms for the continuous quadratic Knapsack problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496126)