Combinatorial optimization problems with uncertain costs and the OWA criterion (Q482291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1305.5339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the min-max (regret) versions of min cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of a class of combinatorial optimization problems with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the Min-Max selecting items problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choquet-based optimisation in multiobjective shortest path and spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for OWA-optimization in multiobjective spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the min-max (regret) selecting items problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of minmax (regret) network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for the min-Max selecting items problem with uncertain weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of robust spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3252269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear programs with the ordered weighted averaging objective. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ordered weighted averaging aggregation operators in multicriteria decisionmaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the robust shortest path problem. / rank
 
Normal rank

Latest revision as of 12:07, 9 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial optimization problems with uncertain costs and the OWA criterion
scientific article

    Statements

    Combinatorial optimization problems with uncertain costs and the OWA criterion (English)
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    combinatorial optimization
    0 references
    OWA operator
    0 references
    robust optimization
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references