Pages that link to "Item:Q1077441"
From MaRDI portal
The following pages link to Minimizing bumps in linear extensions of ordered sets (Q1077441):
Displaying 11 items.
- Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- The connection between the bump number problem and flow-shop scheduling with precedence constraints (Q753673) (← 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 for posets of width two (Q1114719) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- The setup polyhedron of series-parallel posets (Q1372744) (← 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)
