Theory and methods of Euclidian combinatorial optimization: current status and prospects
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 919758
- scientific article; zbMATH DE number 2169759
- Convex extensions in combinatorial optimization and their applications
- Continuous representations and functional extensions in combinatorial optimization
- A two-step method for solving vector optimization problems on permutation configuration
Cites work
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
- A problem of packing of homothetic convex polytopes
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
- An Automatic Method of Solving Discrete Programming Problems
- Automatic classification method based on a fuzzy similarity relation
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- Classification of applied methods of combinatorial optimization
- Combinatorial configurations in balance layout optimization problems
- Combinatorial optimization under uncertainty
- Combinatorial optimization. Theory and algorithms.
- Configuration space of geometric objects
- Construction of convex continuations for functions defined on a hypersphere
- Construction of Hamiltonian paths in graphs of permutation polyhedra
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Continuous representations and functional extensions in combinatorial optimization
- Convex extensions in combinatorial optimization and their applications
- Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization
- Description and generation of permutations containing cycles
- Existence of solutions in vector optimization problems
- Formalization and classification of combinatorial optimization problems
- Formalizing spatial configuration optimization problems with the use of a special function class
- Generating combinatorial sets with given properties
- Group structures on quotient sets in classification problems
- Handbook of combinatorial optimization. In 5 volumes
- scientific article; zbMATH DE number 3828714 (Why is no real title available?)
- scientific article; zbMATH DE number 4047424 (Why is no real title available?)
- scientific article; zbMATH DE number 4127014 (Why is no real title available?)
- scientific article; zbMATH DE number 2169442 (Why is no real title available?)
- scientific article; zbMATH DE number 2124592 (Why is no real title available?)
- scientific article; zbMATH DE number 3360173 (Why is no real title available?)
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Modeling and optimization in space engineering. State of the art and new challenges
- On some classes of optimization problems on a set of allocations and their properties
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
- Point-set methods of clusterization of standard information
- Polyhedral techniques in combinatorial optimization I: Theory
- Polyhedral techniques in combinatorial optimization II: applications and computations
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Qualitative characteristics of the stability vector discrete optimization problems with different optimality principles
- Set coverings and tolerance relations
- Shor's r-algorithms: theory and practice
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- The method of artificial space dilation in problems of optimal packing of geometric objects
- The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
- The theory of convex continuations of functions at the vertices of convex polygons
- The theory of convex extensions in combinatorial optimization problems
- Theory and software implementations of Shor's r-algorithms
- Transportation problems on permutations: properties of estimates in the branch and bound method
Cited in
(16)- Methods of constructing argument of objective function in combinatorial optimization problems
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Combinatorial optimization in geometry
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Combinatorial configurations in the definition of antimagic labelings of graphs
- A two-step method for solving vector optimization problems on permutation configuration
- Solution of Euclidean combinatorial optimization problems by the method of construction of a lexicographic equivalence
- The theory of convex extensions in combinatorial optimization problems
- scientific article; zbMATH DE number 2168903 (Why is no real title available?)
- scientific article; zbMATH DE number 2169759 (Why is no real title available?)
- scientific article; zbMATH DE number 1450273 (Why is no real title available?)
- Continuous representations and functional extensions in combinatorial optimization
- Continuous extensions on Euclidean combinatorial configurations
- Planning of logistics missions of the ``UAV+vehicle hybrid systems
- The polyhedral-surface cutting plane method of optimization over a vertex-located set
- Solving a multi-objective optimization problem on combinatorial point configurations
This page was built for publication: Theory and methods of Euclidian combinatorial optimization: current status and prospects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215570)
