Pages that link to "Item:Q1106865"

The following pages link to Computing the bump number with techniques from two-processor scheduling (Q1106865):

Displaying 8 items.

• Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
• The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
• Computing the bump number is easy (Q1106863) (← links)
• Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
• Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• The setup polyhedron of series-parallel posets (Q1372744) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)