Pages that link to "Item:Q393848"
From MaRDI portal
The following pages link to Combinatorial and geometric properties of the max-cut and min-cut problems (Q393848):
Displayed 3 items.
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)