scientific article; zbMATH DE number 1163097

MaRDI QIDQ4394586zbMATH OpenFDO

Authors Olof Damberg, Athanasios Migdalas, Sverre Storøy

Publication date 11 June 1998

zbMATH Keywords

breadth-first-searchlinear network problemsbipartite assignmentmany-to-one assignment

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• A parallel shortest augmenting path algorithm for the assignment problem
• scientific article; zbMATH DE number 795218
• Parallel optimization for traffic assignment
• Massively parallel augmenting path algorithms for the assignment problem

Cited in

(14)

• Parallel Algorithms for Zero-One Supply-Demand Problems
• PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS
• Data parallel computing for network-structured optimization problems
• A parallel algorithm manager for networked workstations
• Parallel Computing on Heterogeneous Networks
• Parallel data processing in computer networks
• Parallel algorithms for the assignment and minimum-cost flow problems
• scientific article; zbMATH DE number 795218 (Why is no real title available?)
• Parallel optimization for traffic assignment
• scientific article; zbMATH DE number 3850854 (Why is no real title available?)
• Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
• Parallel algorithms for a multi-level network optimization problem
• Efficient Parallel Routing Algorithms for Cartesian and Composition Networks
• The network simplex method on a multiprocessor

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 Q4394586)