Pages that link to "Item:Q2467347"
From MaRDI portal
The following pages link to Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347):
Displaying 9 items.
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Hybrid metaheuristics for stochastic constraint programming (Q2342607) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
