Generalized multiple objective bottleneck problems (Q453049): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shortest chain subject to side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Constrained Bottleneck Problem in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic bottleneck problems / 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: Q3039055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved general procedure for lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for a class of knapsack problems with binary weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-Max-optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving 0-1 Minimax Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility of minimax to minisum 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of a linear convolution of criteria in multicriterial discrete programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear convolution of criteria in the bicriteria traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical analysis of tricriteria tree and assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of the linear parametrization of criteria in the bicriteria knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial problems with combined min-max-min-sum objective and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum-max bicriterion path problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tricriterion shortest path problem with at least two bottleneck objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for the tricriteria shortest path problem with two bottleneck objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic balanced optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(m\log n)\) algorithm for the max+sum spanning tree problem / rank
 
Normal rank

Latest revision as of 17:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Generalized multiple objective bottleneck problems
scientific article

    Statements

    Generalized multiple objective bottleneck problems (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2012
    0 references
    0 references
    combinatorial optimization
    0 references
    multiple objective
    0 references
    bottleneck
    0 references
    \(k\)-max
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references