Pages that link to "Item:Q1127327"

The following pages link to Shortest common superstrings and scheduling with coordinated starting times (Q1127327):

Displaying 3 items.

• Recognition of overlap graphs (Q405660) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)