Theory and methods of Euclidian combinatorial optimization: current status and prospects
type: Item
instance of: scholarly article
title: Theory and methods of Euclidian combinatorial optimization: current status and prospects
zbMATH Open document ID: 1458.90562
published in: Cybernetics and Systems Analysis
publication date: 2020-12-14T00:00:00Z
review text: 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.
reviewed by: Vladimír Lacko
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7285093
zbMATH Keywords: combinatorial configuration
zbMATH Keywords: Euclidean combinatorial set
zbMATH Keywords: Euclidean models
zbMATH Keywords: optimization
author: Yu. Stoyan
author: Sergey Yakovlev
MaRDI profile type: Publication
full work available at URL: s10559-020-00253-6
OpenAlex ID: W3028917691
cites work: Handbook of Combinatorial Optimization
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Classification of applied methods of combinatorial optimization
cites work: Formalization and classification of combinatorial optimization problems
cites work: Q5633999
cites work: Q3673576
cites work: A problem of packing of homothetic convex polytopes
cites work: Polyhedral techniques in combinatorial optimization I: Theory
cites work: Polyhedral techniques in combinatorial optimization II: applications and computations
cites work: Continuous representations and functional extensions in combinatorial optimization
cites work: Continuous Approaches to the Unconstrained Binary Quadratic Problems
cites work: The theory of convex continuations of functions at the vertices of convex polygons
cites work: Convex extensions in combinatorial optimization and their applications
cites work: Q4206578
cites work: Properties of combinatorial optimization problems over polyhedral-spherical sets
cites work: Construction of convex continuations for functions defined on a hypersphere
cites work: Description and generation of permutations containing cycles
cites work: Generating combinatorial sets with given properties
cites work: Q3783828
cites work: Bounds on the minimum of convex functions on Euclidean combinatorial sets
cites work: The theory of convex extensions in combinatorial optimization problems
cites work: Q4831941
cites work: Q3362481
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
cites work: Transportation problems on permutations: properties of estimates in the branch and bound method
cites work: Shor's \(r\)-algorithms: theory and practice
cites work: Theory and software implementations of Shor's \(r\)-algorithms
cites work: Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
cites work: Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization
cites work: A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
cites work: The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
cites work: Construction of Hamiltonian paths in graphs of permutation polyhedra
cites work: Configuration space of geometric objects
cites work: Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
cites work: Combinatorial configurations in balance layout optimization problems
cites work: Modeling and optimization in space engineering. State of the art and new challenges
cites work: Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
cites work: Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
cites work: The method of artificial space dilation in problems of optimal packing of geometric objects
cites work: Automatic classification method based on a fuzzy similarity relation
cites work: Q4676883
cites work: Combinatorial optimization under uncertainty
cites work: Point-set methods of clusterization of standard information
cites work: Set coverings and tolerance relations
cites work: Group structures on quotient sets in classification problems
cites work: Qualitative characteristics of the stability vector discrete optimization problems with different optimality principles
cites work: Existence of solutions in vector optimization problems
cites work: An approach to solving discrete vector optimization problems over a combinatorial set of permutations
cites work: Formalizing spatial configuration optimization problems with the use of a special function class
DOI: 10.1007/S10559-020-00253-6
description: scientific article