Bound sets for biobjective combinatorial optimization problems (Q875413): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial 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: Theory of multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / 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: A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria dynamic programming with an application to the integer case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined approach to solve binary multicriteria problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039055 / rank
 
Normal rank

Latest revision as of 16:13, 25 June 2024

scientific article
Language Label Description Also known as
English
Bound sets for biobjective combinatorial optimization problems
scientific article

    Statements

    Bound sets for biobjective combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    13 April 2007
    0 references
    multiobjective discrete optimization
    0 references
    lower bound
    0 references
    upper bound
    0 references
    heuristics
    0 references
    relaxation
    0 references

    Identifiers