A survey and annotated bibliography of multiobjective combinatorial optimization (Q1841810): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s002910000046 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s002910000046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083743691 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S002910000046 / rank
 
Normal rank

Latest revision as of 10:15, 16 December 2024

scientific article
Language Label Description Also known as
English
A survey and annotated bibliography of multiobjective combinatorial optimization
scientific article

    Statements

    A survey and annotated bibliography of multiobjective combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2003
    0 references
    The paper gives a structured overview of the field of MultiObjective Combinatorial Optimization (MOCO) with a focus on recent developments (since 1994) while referring to earlier survey articles for most of the previous work. After an introduction and formulation of the problem, including an outline of different notions of optimality, theoretical properties of MOCO problems are discussed. Solution methods applied to MOCO problems are reviewed, covering exact methods as well as approximation methods such as simulated annealing, tabu search, genetic algorithms and other recent developments. The subsequent annotated literature review is organized according to the combinatorial structure of MOCO problems and using a classification scheme based on four categories, namely the combinatorial structure, the type of objective function, the problem type and the suggested solution method. Problems included are shortest path problems, assignment problems, transportation and transshipment problems, network flow problems, spanning tree problems, matroids and matroid intersections, the travelling salesman problem, knapsack problems, location problems, set covering problems, and others.
    0 references
    multicriteria optimization
    0 references
    combinatorial optimization
    0 references
    bibliography
    0 references
    exact methods
    0 references
    heuristics
    0 references

    Identifiers

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