The following pages link to (Q5646916):
Displaying 9 items.
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- Chain dominated orders (Q862975) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- A structure theory for ordered sets (Q1151913) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161) (← links)
- Minimizing Setups for Cycle-Free Ordered Sets (Q3960747) (← links)
- (Q4200070) (← links)
