On a biobjective search problem in a line: formulations and algorithms (Q393048): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple criteria combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of efficient solutions in multiple objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for a class of knapsack problems with binary weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming in multiplicative lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector-Valued Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving efficiently the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental algorithms. 8th international symposium, SEA 2009, Dortmund, Germany, June 4--6, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank

Latest revision as of 06:29, 7 July 2024

scientific article
Language Label Description Also known as
English
On a biobjective search problem in a line: formulations and algorithms
scientific article

    Statements

    On a biobjective search problem in a line: formulations and algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    multiobjective combinatorial optimization
    0 references
    dynamic programming
    0 references
    shortest path problems
    0 references
    knapsack problems
    0 references
    0 references