Pages that link to "Item:Q1662101"
From MaRDI portal
The following pages link to Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101):
Displaying 4 items.
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)
