An improved partial solution to the task assignment and multiway cut problems

DOI10.1016/0167-6377(92)90015-UzbMath0754.68019OpenAlexW2014032181MaRDI QIDQ1200754

Vangelis F. Magirou

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90015-u

zbMATH Keywords

graph flow algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

The task allocation problem with constant communication. ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Exact solution of emerging quadratic assignment problems ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ An algorithm for the generalized quadratic assignment problem

Cites Work

• An algorithm for the multiprocessor assignment problem
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

This page was built for publication: An improved partial solution to the task assignment and multiway cut problems