Pages that link to "Item:Q895779"
From MaRDI portal
The following pages link to A semidefinite optimization approach to the target visitation problem (Q895779):
Displayed 4 items.
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- The target visitation arc routing problem (Q2121609) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- A linear ordering problem with weighted rank (Q6117320) (← links)