Pages that link to "Item:Q2467359"
From MaRDI portal
The following pages link to Another look at graph coloring via propositional satisfiability (Q2467359):
Displaying 14 items.
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
- Dynamic Symmetry Breaking by Simulating Zykov Contraction (Q3637171) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
