Pages that link to "Item:Q762183"
From MaRDI portal
The following pages link to Minimizing setups in ordered sets of fixed width (Q762183):
Displaying 20 items.
- Finding the largest suborder of fixed width (Q687176) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Minimizing bumps in linear extensions of ordered sets (Q1077441) (← 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)
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Minimizing bumps for posets of width two (Q1114719) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- On a setup optimization problem for interval orders (Q1195865) (← links)
- An improved algorithm for the jump number problem (Q1603444) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- Scheduling of resource tasks (Q1809809) (← links)
- On some new types of greedy chains and greedy linear extensions of partially ordered sets (Q1894377) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
