The following pages link to (Q2999650):
Displaying 4 items.
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming (Q305479) (← links)
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices (Q408370) (← links)
- (Q5743492) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
