Pages that link to "Item:Q2275580"
From MaRDI portal
The following pages link to A branch-and-price approach for the partition coloring problem (Q2275580):
Displaying 13 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- Perfectness of clustered graphs (Q1799385) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)