Pages that link to "Item:Q1651600"
From MaRDI portal
The following pages link to An exact algorithm for the partition coloring problem (Q1651600):
Displaying 10 items.
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
- Algorithmic discrepancy beyond partial coloring (Q4978034) (← links)
- An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs (Q5106386) (← links)
- Recent Advances in Constraints (Q5899108) (← links)