The polyhedral-surface cutting plane method of optimization over a vertex-located set

DOI10.1007/978-3-030-65739-0_7OpenAlexW3124173839MaRDI QIDQ6130877

Oksana Pichugina, Nadezhda Muravyova, Liudmyla Koliechkina

Publication date: 3 April 2024

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_7

zbMATH Keywords

surface relaxationcutting plane methodpolyhedral relaxationcircumsurfacelinear combinatorial optimizationvertex-located set

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving linear conditional completely combinatorial optimization problems on permutations by the branch and bound method
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Geometric algorithms and combinatorial optimization.
• Convex extensions in combinatorial optimization and their applications
• Homology representations arising from the half cube. II
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
• Continuous Approaches to the Unconstrained Binary Quadratic Problems
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming

This page was built for publication: The polyhedral-surface cutting plane method of optimization over a vertex-located set