An interactive heuristic method for multi-objective combinatorial optimization (Q1569903): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387182 / 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: Performance of the MOSA method for the bicriteria assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi‐objective combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: General local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOSA method: a tool for solving multiobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495184 / rank
 
Normal rank

Revision as of 11:30, 30 May 2024

scientific article
Language Label Description Also known as
English
An interactive heuristic method for multi-objective combinatorial optimization
scientific article

    Statements

    An interactive heuristic method for multi-objective combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    9 July 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    multiobjective programming
    0 references
    combinatorial optimization
    0 references
    knapsack problem
    0 references
    assignment problem
    0 references
    simulated annealing
    0 references