Pages that link to "Item:Q1097902"
From MaRDI portal
The following pages link to Greedy posets for the bump-minimizing problem (Q1097902):
Displaying 4 items.
- 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)
- Computing the bump number is easy (Q1106863) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
