The following pages link to (Q5687246):
Displayed 26 items.
- Projection Methods in Conic Optimization (Q2802538) (← links)
- Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- A Direct Algorithm for Multi-valued Bounded Model Checking (Q3540066) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- Branch decompositions and minor containment (Q4446913) (← links)
- Spectral Bounds for the k-Regular Induced Subgraph Problem (Q4554522) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- An analysis of parameter adaptation in reactive tabu search (Q4979993) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- BiqBin: Moving Boundaries for NP-hard Problems by HPC (Q5119114) (← links)
- SATO: An efficient propositional prover (Q5234711) (← links)
- A branch-and-price approach for the maximum weight independent set problem (Q5717716) (← links)
- Algorithm portfolios (Q5940819) (← links)
- Upper bounds on the Laplacian spread of graphs (Q5962499) (← links)
- An interdisciplinary experimental evaluation on the disjunctive temporal problem (Q6080502) (← links)
- Recycling inequalities for robust combinatorial optimization with budget uncertainty (Q6085989) (← links)
- An exact algorithm for the maximum quasi‐clique problem (Q6088204) (← links)
- Upper and lower bounds based on linear programming for the b-coloring problem (Q6114961) (← links)