Pages that link to "Item:Q1114719"
From MaRDI portal
The following pages link to Minimizing bumps for posets of width two (Q1114719):
Displaying 10 items.
- Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Greedy linear extensions for minimizing bumps (Q1092935) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- A comparison of algorithms for minimizing bumps in linear extensions of partial orders (Q1820992) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)