An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations

DOI10.1287/ijoc.3.4.299zbMath0775.90286OpenAlexW1977990920MaRDI QIDQ4015415

Zhiming Wang, Jeffrey L. Kennington

Publication date: 11 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.3.4.299

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Data parallel computing for network-structured optimization problems ⋮ The \(k\)-cardinality assignment problem ⋮ Massively parallel augmenting path algorithms for the assignment problem ⋮ Supply capacity acquisition and allocation with uncertain customer demands ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Topological expansion of multiple-ring metropolitan area networks ⋮ A comparison of two algorithms for the assignment problem ⋮ A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem ⋮ Linear and semi-assignment problems: A core oriented approach ⋮ Addressing capacity uncertainty in resource-constrained assignment problems ⋮ The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

This page was built for publication: An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations