Finding representative systems for discrete bicriterion optimization problems (Q2467474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2006.03.019 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Sandwich approximation of univariate convex functions with an application to separable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria optimization: State of the art annotated bibliographic surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria decision analysis. State of the art surveys / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex curves with application to the bicriterial minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective minimum cost flow problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased approximation in multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm robust for the bicriteria discrete optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximate representation of bi-objective tradeoff sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive rectangle elimination method for biobjective decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation methods in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for convex curve approximation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2006.03.019 / rank
 
Normal rank

Latest revision as of 19:56, 18 December 2024

scientific article
Language Label Description Also known as
English
Finding representative systems for discrete bicriterion optimization problems
scientific article

    Statements

    Finding representative systems for discrete bicriterion optimization problems (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    multicriteria optimization
    0 references
    efficient solution
    0 references
    approximation
    0 references
    representative systems
    0 references
    box algorithm
    0 references
    quality measures
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers