Properties of combinatorial optimization problems over polyhedral-spherical sets

DOI10.1007/s10559-018-0011-6zbMath1390.90489OpenAlexW2788382349MaRDI QIDQ1745702

O. S. Pichugina, S. V. Yakovliev

Publication date: 18 April 2018

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0011-6

zbMATH Keywords

combinatorial optimizationcontinuous representationconvex extensionpolyhedral-spherical set

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (4)

Configuration space of geometric objects ⋮ Theory and methods of Euclidian combinatorial optimization: current status and prospects ⋮ Unnamed Item ⋮ Formalizing spatial configuration optimization problems with the use of a special function class

Uses Software

• 2L_enum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unconstrained binary quadratic programming problem: a survey
• Methods of optimization and systems analysis for problems of transcomputational complexity.
• Development and analysis of cooperative model-based metaheuristics
• Continuous representations and functional extensions in combinatorial optimization
• The method of artificial space dilation in problems of optimal packing of geometric objects
• Classification of applied methods of combinatorial optimization
• Metaheuristic downhill simplex method in combinatorial optimization
• Construction of convex continuations for functions defined on a hypersphere
• Enumeration of 2-level polytopes
• Localization of solutions of some problems of nonlinear integer optimization
• The theory of convex continuations of functions at the vertices of convex polygons
• Combinatorics of Permutations
• Continuous Approaches to the Unconstrained Binary Quadratic Problems
• A problem of packing of homothetic convex polytopes
• Bounds on the minimum of convex functions on Euclidean combinatorial sets
• The theory of convex extensions in combinatorial optimization problems
• Handbook of Combinatorial Optimization
• Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Properties of combinatorial optimization problems over polyhedral-spherical sets