scientific article; zbMATH DE number 176478
zbMATH Open0772.90045MaRDI QIDQ4035640FDOQ4035640
Authors: Mustafa Ç. Pınar, Stavros A. Zenios 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- A smooth penalty function algorithm for network-structured problems
- scientific article; zbMATH DE number 1552018
- scientific article; zbMATH DE number 4199934
parallel implementationlinearization techniquelinear-quadratic penalty formsvery large multicommodity network flow problems
Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (9)
- Title not available (Why is that?)
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- A scaling algorithm for multicommodity flow problems
- Title not available (Why is that?)
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- Multicommodity network flows: A survey. II: Solution methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035640)
