Bilevel time minimizing assignment problem

DOI10.1016/j.amc.2006.06.050zbMath1112.90071OpenAlexW2076089182MaRDI QIDQ865542

Sonia Puri, Munish C. Puri

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.06.050

zbMATH Keywords

combinatorial optimizationconcave minimization problemtime minimizing assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

On a pair of job-machine assignment problems with two stages ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• On the bottleneck assignment problem
• An algorithm for the bottleneck generalized assignment problem
• Bottleneck assignment problems under categorization
• Solving the Assignment Problem by Relaxation
• A min max problem
• Some Generalisations of the Time Minimising Assignment Problem
• On the solution of a stochastic bottleneck assignment problem and its variations
• The alternating basis algorithm for assignment problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem

This page was built for publication: Bilevel time minimizing assignment problem