An improved general procedure for lexicographic bottleneck problems (Q1306359): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An algebraic approach to assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic optimisation in generalised network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundational aspects of theories of measurement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136931 / rank
 
Normal rank

Revision as of 09:28, 29 May 2024

scientific article
Language Label Description Also known as
English
An improved general procedure for lexicographic bottleneck problems
scientific article

    Statements

    An improved general procedure for lexicographic bottleneck problems (English)
    0 references
    0 references
    0 references
    0 references
    9 February 2001
    0 references
    0 references
    lexicographic problem
    0 references
    bottleneck problem
    0 references
    combinatorial optimization
    0 references