Pages that link to "Item:Q1111581"
From MaRDI portal
The following pages link to On minimizing the jump number for interval orders (Q1111581):
Displaying 9 items.
- Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
- A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Interval reductions and extensions of orders: Bijections to chains in lattices (Q1304911) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- Jumps of Orderings (Q3484823) (← links)
- (Q3718741) (← links)