Pages that link to "Item:Q3960747"
From MaRDI portal
The following pages link to Minimizing Setups for Cycle-Free Ordered Sets (Q3960747):
Displaying 33 items.
- Scheduling with few changes (Q299829) (← links)
- Minimizing the maximum bump cost in linear extensions of a poset (Q385489) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- A polynomially solvable case of optimal linear extension problem of a poset (Q613667) (← links)
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Chordal bipartite graphs and crowns (Q1071029) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Minimizing bumps for posets of width two (Q1114719) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- Cycle-free partial orders and chordal comparability graphs (Q1182042) (← links)
- A greedy reduction algorithm for setup optimization (Q1183348) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- Maximum and minimum jump number of posets from matrices (Q1194526) (← links)
- On a setup optimization problem for interval orders (Q1195865) (← links)
- Some new explorations into the mystery of time and band limiting (Q1201934) (← links)
- Semantic networks (Q1202620) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Split orders (Q1422429) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Obituary: Ivan Rival (Q1826506) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
