Pages that link to "Item:Q1061150"
From MaRDI portal
The following pages link to Greedy linear extensions to minimize jumps (Q1061150):
Displaying 11 items.
- Inequalities for the greedy dimensions of ordered sets (Q1065837) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← links)
- Constructing greedy linear extensions by interchanging chains (Q1087566) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Greedy linear extensions with constraints (Q1821122) (← links)
- Obituary: Ivan Rival (Q1826506) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Orders with level diagrams (Q2640624) (← links)
