A variation of the assignment problem

DOI10.1016/0377-2217(93)90198-VzbMath0782.90070MaRDI QIDQ1309926

V. Pereyra

Publication date: 20 December 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

bottleneck assignmentbicriteria assignmentcost minimizing assignmenttrade-off pairs

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (6)

Assignment problems: a golden anniversary survey ⋮ Max-min matching problems with multiple assignments ⋮ Task assignment in tree-like hierarchical structures ⋮ On weighting two criteria with a parameter in combinatorial optimization problems ⋮ On solving a variation of the assignment problem ⋮ On bilevel fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• On the bottleneck assignment problem
• The Constrained Bottleneck Problem in Networks
• New Methods in Mathematical Programming—The Solid Transportation Problem
• Solving the Assignment Problem by Relaxation
• Bicriteria Transportation Problem
• The alternating basis algorithm for assignment problems
• Letter to the Editor—The Multidimensional Assignment Problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

This page was built for publication: A variation of the assignment problem