Pages that link to "Item:Q1028475"
From MaRDI portal
The following pages link to Paintshop, odd cycles and necklace splitting (Q1028475):
Displaying 8 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Greedy colorings of words (Q444455) (← links)
- Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Greedy colorings for the binary paintshop problem (Q2266932) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
