The following pages link to (Q3320091):
Displaying 15 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 note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem (Q909576) (← links)
- A sequencing problem in the weaving industry (Q1207057) (← links)
- Sequencing with restrictions in processing times (Q1393012) (← links)
- The weighted fair sequences problem (Q1652547) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- Minimizing flowtime and missed due-dates in single-machine sequencing (Q2640435) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- A Sequencing Problem with Release Dates and Clustered Jobs (Q3731355) (← links)
- Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions (Q3760291) (← links)
- A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632) (← links)
