Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504): 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: 1207.3165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision-making based on approximate and smoothed Pareto curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Min-Max (Regret) Versions of Some Polynomial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A naïve approach for solving MCDM problems: the GUESS method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive weighted Tchebycheff procedure for multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Compromise Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Results on Compromise Solutions for Group Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compromise solutions and estimation of the noninferior set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4605946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Rounding for Multi-Objective Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ``Light Beam Search'' approach. -- An overview of methodology and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compromise programming: non-interactive calibration of utility-based metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A visual interactive method for solving the multiple criteria problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for optimizing a class of low-rank functions over a polytope / 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: Approximation in stochastic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compromise solution by MCDM methods: A comparative analysis of VIKOR and TOPSIS. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently computing succinct trade-off curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizations of the Euclidean compromise solution / 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: Q3882210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical basis for satisficing decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria decision making: advances in MCDM models, algorithms, theory, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Solutions for Group Decision Problems / rank
 
Normal rank

Latest revision as of 17:13, 15 July 2024

scientific article
Language Label Description Also known as
English
Reference points and approximation algorithms in multicriteria discrete optimization
scientific article

    Statements

    Reference points and approximation algorithms in multicriteria discrete optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    multicriteria optimization
    0 references
    approximation algorithms
    0 references
    reference point methods
    0 references
    compromise programming
    0 references
    combinatorial optimization
    0 references
    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