The following pages link to (Q3320091):
Displayed 7 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632) (← links)