The following pages link to (Q4496022):
Displayed 12 items.
- Semidefinite relaxations of ordering problems (Q359627) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- On VLSI interconnect optimization and linear ordering problem (Q2443401) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Variable neighborhood search for the linear ordering problem (Q2496057) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming (Q2636608) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)