Pages that link to "Item:Q429677"
From MaRDI portal
The following pages link to An exact approach for the vertex coloring problem (Q429677):
Displaying 10 items.
- Vehicle Sequencing at Transshipment Terminals with Handover Relations (Q4995083) (← links)
- Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- Projective Cutting-Planes (Q5221062) (← links)
- Exact algorithms for a discrete metric labeling problem (Q5899363) (← links)
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
- Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)
- Solving the list coloring problem through a branch-and-price algorithm (Q6586219) (← links)
- A memetic algorithm with adaptive operator selection for graph coloring (Q6635978) (← links)