Theory and methods of Euclidian combinatorial optimization: current status and prospects (Q2215570): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 03:23, 2 February 2024

scientific article
Language Label Description Also known as
English
Theory and methods of Euclidian combinatorial optimization: current status and prospects
scientific article

    Statements

    Theory and methods of Euclidian combinatorial optimization: current status and prospects (English)
    0 references
    0 references
    0 references
    14 December 2020
    0 references
    The paper provides a review of Euclidean combinatorial optimization methods applicable to discrete optimization problems on a set of combinatorial configurations mapped into an arithmetic Euclidean space. Mapping of combinatorial configurations into an arithmetic Euclidean space forms a so called images of combinatorial sets. The paper describes various properties of images and proposes a theory of continuous functional representations and convex extensions for solving this class of problems. The paper concludes with areas of practical application and promising research.
    0 references
    0 references
    combinatorial configuration
    0 references
    Euclidean combinatorial set
    0 references
    Euclidean models
    0 references
    optimization
    0 references