Continuous representations and functional extensions in combinatorial optimization

DOI10.1007/S10559-016-9894-2MaRDI QIDQ508577zbMATH OpenOpenAlexFDO

Authors O. S. Pichugina, Sergey Yakovlev

Publication date 7 February 2017

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

Full work available at URL https://doi.org/10.1007/s10559-016-9894-2

zbMATH Keywords

combinatorial optimizationextension of functionsBoolean setcontinuous functional representation of a seteuclidean combinatorial setgeneral set of permutations

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Convex extensions in combinatorial optimization and their applications
• Continuous extensions on Euclidean combinatorial configurations
• Construction of convex continuations for functions defined on a hypersphere
• The theory of convex extensions in combinatorial optimization problems

Cites work

• 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 3618052 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 2168886 (Why is no real title available?)
• scientific article; zbMATH DE number 2124592 (Why is no real title available?)
• A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
• An algorithm for nonlinear optimization problems with binary variables
• Classification of applied methods of combinatorial optimization
• Construction of convex continuations for functions defined on a hypersphere
• Continuous approaches for solving discrete optimization problems
• Functionally redundant constraints for Boolean quadratic-type optimization problems
• Generating combinatorial sets with given properties
• Localization of solutions of some problems of nonlinear integer optimization
• Metaheuristic downhill simplex method in combinatorial optimization
• On some classes of optimization problems on a set of allocations and their properties
• Permutohedra, Associahedra, and Beyond
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• The theory of convex continuations of functions at the vertices of convex polygons
• The unconstrained binary quadratic programming problem: a survey

Cited in

(7)

• Convex extensions in combinatorial optimization and their applications
• Formalizing spatial configuration optimization problems with the use of a special function class
• Continuous extensions on Euclidean combinatorial configurations
• The method of artificial space dilation in problems of optimal packing of geometric objects
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Configuration space of geometric objects
• Properties of combinatorial optimization problems over polyhedral-spherical sets

This page was built for publication: Continuous representations and functional extensions in combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508577)