A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MOIP_AIRA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974080590 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.5266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bi-criterion integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2875213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear integer bicriterion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representative systems for discrete bicriterion optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the multiple objective integer linear programming 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: Finding all nondominated points of multi-objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: an improved recursive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for solving biobjective integer programs / 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: 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: An interactive weighted Tchebycheff procedure for multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of ideal and Nadir values and implications for their use in MCDM methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:28, 10 July 2024

scientific article
Language Label Description Also known as
English
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
scientific article

    Statements

    A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (English)
    0 references
    0 references
    0 references
    30 April 2015
    0 references
    discrete tricriteria optimization
    0 references
    scalarization
    0 references
    box algorithm
    0 references
    0 references
    0 references

    Identifiers

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