Pages that link to "Item:Q2448920"
From MaRDI portal
The following pages link to A branch-and-price algorithm for the robust graph coloring problem (Q2448920):
Displaying 16 items.
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- The \(\gamma\)-connected assignment problem (Q1307813) (← links)
- Accelerating the branch-and-price algorithm using machine learning (Q1653391) (← links)
- The robust coloring problem. (Q1812001) (← links)
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- A hybrid algorithm for the robust graph coloring problem (Q3178960) (← links)
- Coloración de gráficas suaves (Q3179056) (← links)
- Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
- Heuristics for the robust coloring problem (Q5177316) (← links)
- AI 2003: Advances in Artificial Intelligence (Q5191586) (← links)
- New results on the robust coloring problem (Q6127005) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)