Pages that link to "Item:Q5899384"
From MaRDI portal
The following pages link to Exploring the complexity boundary between coloring and list-coloring (Q5899384):
Displayed 3 items.
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)