Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128549610, #quickstatements; #temporary_batch_1726270021205
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911449251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a linear function over an integer efficient set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over the efficient set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization over the efficient set: Four special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L\)-shape search method for triobjective integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for optimizing a linear function over the efficient set of a multiobjective integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a linear function over an efficient set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4670576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for optimizing a linear function over an integer efficient set / 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: Computing the nadir point for multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding nadir points in multi-objective integer programs / 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: Multi-objective integer programming: a general approach for generating all non-dominated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximization of a function over the efficient set via a penalty function approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128549610 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:37, 14 September 2024

scientific article; zbMATH DE number 7768701
Language Label Description Also known as
English
Optimizing a linear function over the nondominated set of multiobjective integer programs
scientific article; zbMATH DE number 7768701

    Statements

    Optimizing a linear function over the nondominated set of multiobjective integer programs (English)
    0 references
    0 references
    21 November 2023
    0 references
    multiple objective programming
    0 references
    integer programming
    0 references
    nondominated set
    0 references
    combinatorial optimization
    0 references
    0 references

    Identifiers