Theory and methods of Euclidian combinatorial optimization: current status and prospects
From MaRDI portal
Publication:2215570
DOI10.1007/s10559-020-00253-6zbMath1458.90562OpenAlexW3028917691MaRDI QIDQ2215570
S. V. Yakovliev, Yu. G. Stoyan
Publication date: 14 December 2020
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-020-00253-6
Related Items (5)
Planning of logistics missions of the ``UAV+vehicle hybrid systems ⋮ The polyhedral-surface cutting plane method of optimization over a vertex-located set ⋮ Unnamed Item ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ A two-step method for solving vector optimization problems on permutation configuration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automatic classification method based on a fuzzy similarity relation
- Continuous representations and functional extensions in combinatorial optimization
- Theory and software implementations of Shor's \(r\)-algorithms
- The method of artificial space dilation in problems of optimal packing of geometric objects
- Combinatorial configurations in balance layout optimization problems
- Classification of applied methods of combinatorial optimization
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
- Set coverings and tolerance relations
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
- Combinatorial optimization under uncertainty
- Construction of convex continuations for functions defined on a hypersphere
- Point-set methods of clusterization of standard information
- Configuration space of geometric objects
- Modeling and optimization in space engineering. State of the art and new challenges
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Formalization and classification of combinatorial optimization problems
- Shor's \(r\)-algorithms: theory and practice
- Convex extensions in combinatorial optimization and their applications
- The theory of convex continuations of functions at the vertices of convex polygons
- Construction of Hamiltonian paths in graphs of permutation polyhedra
- Description and generation of permutations containing cycles
- Transportation problems on permutations: properties of estimates in the branch and bound method
- Solving the conditional optimization problem for a fractional linear objective function on a set of arrangements by the branch and bound method
- Generating combinatorial sets with given properties
- Qualitative characteristics of the stability vector discrete optimization problems with different optimality principles
- Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
- Group structures on quotient sets in classification problems
- The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations
- Formalizing spatial configuration optimization problems with the use of a special function class
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Balance Layout Problems: Mathematical Modeling and Nonlinear Optimization
- An Automatic Method of Solving Discrete Programming Problems
- A problem of packing of homothetic convex polytopes
- Bounds on the minimum of convex functions on Euclidean combinatorial sets
- Polyhedral techniques in combinatorial optimization II: applications and computations
- The theory of convex extensions in combinatorial optimization problems
- Polyhedral techniques in combinatorial optimization I: Theory
- Handbook of Combinatorial Optimization
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Combinatorial optimization. Theory and algorithms.
- Existence of solutions in vector optimization problems
This page was built for publication: Theory and methods of Euclidian combinatorial optimization: current status and prospects
