Properties of combinatorial optimization problems over polyhedral-spherical sets
type: Item
instance of: scholarly article
title: Properties of combinatorial optimization problems over polyhedral-spherical sets
zbMATH Open document ID: 1390.90489
author: O. S. Pichugina
author: Sergey Yakovlev
published in: Cybernetics and Systems Analysis
publication date: 2018-04-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6861250
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: polyhedral-spherical set
zbMATH Keywords: continuous representation
zbMATH Keywords: convex extension
describes a project that uses: 2L_enum
MaRDI profile type: Publication
full work available at URL: s10559-018-0011-6
OpenAlex ID: W2788382349
cites work: Methods of optimization and systems analysis for problems of transcomputational complexity.
cites work: Handbook of Combinatorial Optimization
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Classification of applied methods of combinatorial optimization
cites work: Q3786278
cites work: Q3783828
cites work: Bounds on the minimum of convex functions on Euclidean combinatorial sets
cites work: The theory of convex continuations of functions at the vertices of convex polygons
cites work: Localization of solutions of some problems of nonlinear integer optimization
cites work: Optimization of linear functions at the vertices of a permutation polyhedron with additional linear constraints
cites work: Q4007538
cites work: Construction of convex continuations for functions defined on a hypersphere
cites work: Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
cites work: Q3552677
cites work: Continuous Approaches to the Unconstrained Binary Quadratic Problems
cites work: Continuous representations and functional extensions in combinatorial optimization
cites work: The theory of convex extensions in combinatorial optimization problems
cites work: The method of artificial space dilation in problems of optimal packing of geometric objects
cites work: Metaheuristic downhill simplex method in combinatorial optimization
cites work: Development and analysis of cooperative model-based metaheuristics
cites work: Q5633999
cites work: A problem of packing of homothetic convex polytopes
cites work: Q3673576
cites work: Combinatorics of permutations
cites work: Q4226695
cites work: Q5484517
cites work: The unconstrained binary quadratic programming problem: a survey
cites work: Enumeration of 2-level polytopes
DOI: 10.1007/S10559-018-0011-6
description: scientific article; zbMATH DE number 6861250