Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.

DOI10.1016/S0898-1221(02)00267-5zbMath1043.90047OpenAlexW2019324147MaRDI QIDQ1416351

Ming-Chang Lee, Jung jun. Lyu, Hsing Paul Luh

Publication date: 14 December 2003

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(02)00267-5

zbMATH Keywords

Linear programmingParallel processingDecomposition algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Decomposition methods (49M27)

Uses Software

• PVM
• Knapsack

Cites Work

• Concurrent banded Cholesky factorization on workstation networks using PVM
• Crew pairing at Air France
• Locomotive assignment with heterogeneous consists at CN North America
• The PVM concurrent computing system: Evolution, experiences, and trends
• Predicting speedup for distributed computing on a token ring network
• An expanding-core algorithm for the exact \(0-1\) knapsack problem
• SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER
• Towards a portable and efficient environment for parallel computing
• Computer Codes for the Analysis of Infeasible Linear Programs

This page was built for publication: Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming.