On graphs of the cone decompositions for the min-cut and max-cut problems
From MaRDI portal
Publication:1751487
DOI10.1155/2016/7863650zbMath1457.90165OpenAlexW2270504252WikidataQ59124627 ScholiaQ59124627MaRDI QIDQ1751487
Andrei Nikolaev, Vladimir E. Bondarenko
Publication date: 25 May 2018
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2016/7863650
Related Items (4)
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm ⋮ On the Skeleton of the Polytope of Pyramidal Tours ⋮ Some properties of the skeleton of the pyramidal tours polytope ⋮ Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial and geometric properties of the max-cut and min-cut problems
- On polyhedron graph density in problems of combinatorial optimization
- On the cut polyhedron.
- A simple proof of the Erdős-Chao Ko-Rado theorem
- On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A simple min-cut algorithm
- On the cut polytope
- Transactions on Rough Sets III
- Geometry of cuts and metrics
This page was built for publication: On graphs of the cone decompositions for the min-cut and max-cut problems
