An improved general procedure for lexicographic bottleneck problems
type: Item
instance of: scholarly article
title: An improved general procedure for lexicographic bottleneck problems
zbMATH Open document ID: 0954.90039
DOI: 10.1016/S0167-6377(99)00013-9
author: Vangelis Th. Paschos
author: F. Della Croce
author: Alexis Tsoukias
published in: Operations Research Letters
publication date: 2001-02-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1347059
zbMATH Keywords: lexicographic problem
zbMATH Keywords: bottleneck problem
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
cites work: An algebraic approach to assignment problems
cites work: Lexicographic bottleneck problems
cites work: Q3942759
cites work: Lexicographic optimisation in generalised network flow problems
cites work: A note on two problems in connexion with graphs
cites work: Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
cites work: Q5519710
cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
cites work: Foundational aspects of theories of measurement
cites work: Q4136931
full work available at URL: s0167-6377(99)00013-9
OpenAlex ID: W2071231483
description: scientific article; zbMATH DE number 1347059