Bilevel time minimizing assignment problem
type: Item
instance of: scholarly article
title: Bilevel time minimizing assignment problem
zbMATH Open document ID: 1112.90071
author: Sonia Puri
author: Munish C. Puri
published in: Applied Mathematics and Computation
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5128283
zbMATH Keywords: time minimizing assignment problem
zbMATH Keywords: concave minimization problem
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.amc.2006.06.050
OpenAlex ID: W2076089182
cites work: Bottleneck assignment problems under categorization
cites work: Q3056948
cites work: A min max problem
cites work: The alternating basis algorithm for assignment problems
cites work: On the solution of a stochastic bottleneck assignment problem and its variations
cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
cites work: Solving the Assignment Problem by Relaxation
cites work: Q5519710
cites work: An algorithm for the bottleneck generalized assignment problem
cites work: On the bottleneck assignment problem
cites work: Some Generalisations of the Time Minimising Assignment Problem
cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
cites work: A strongly polynomial minimum cost circulation algorithm
DOI: 10.1016/J.AMC.2006.06.050
description: scientific article; zbMATH DE number 5128283