Approximation methods in multiobjective programming (Q2583199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q30052812 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-005-5494-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064823886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for bicriteria optimization based on the sensitivity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reference point approximation method for the solution of bicriterial nonlinear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a constructive approximation of the efficient outcomes in bicriterion vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-based approximation in bicriteria programming / 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: A method for convex curve approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the noninferior set in linear biobjective programs using multiparametric decomposition / 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: An interactive rectangle elimination method for biobjective decision making / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem / 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: Piecewise quadratic approximation of the non-dominated set for bi-criteria programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum effort approximation of the Pareto space of convex bi-criteria problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of a set of Pareto-optimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of a pareto set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation method for the efficiency set of multiobjective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two reference point methods in multiple objective mathematical programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search for efficient solutions of multi-criteria problems by target-level method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the efficient point set by perturbation of the ordering cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multiobjective programming problems by discrete representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards finding global representations of the efficient set in multiple objective mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating well-distributed sets of Pareto points for engineering design using physical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The normalized normal constraint method for generating the Pareto frontier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-based approximation in multicriteria programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the noninferior set in multiobjective linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Value Efficient Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of the relationships between feasible and efficient sets and an approximation / 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: Q4778537 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:14, 11 June 2024

scientific article
Language Label Description Also known as
English
Approximation methods in multiobjective programming
scientific article

    Statements

    Approximation methods in multiobjective programming (English)
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    multiobjective programming
    0 references
    approximation
    0 references
    efficient sets
    0 references
    Pareto sets
    0 references
    nondominated sets.
    0 references
    0 references
    0 references

    Identifiers