The following pages link to DIMACS (Q20231):
Displaying 50 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing (Q257213) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- SAT race 2015 (Q334795) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- Breakout local search for maximum clique problems (Q339563) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Generating new test instances by evolving in instance space (Q342041) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- An exact algorithm for the maximum probabilistic clique problem (Q405671) (← links)
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- An integer programming framework for critical elements detection in graphs (Q405684) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Acceleration strategies for the weight constrained shortest path problem with replenishment (Q479240) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Fast multi-scale detection of overlapping communities using local criteria (Q488870) (← links)
- The \(k\)-coloring fitness landscape (Q491197) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- A \(k\)-level data structure for large-scale traveling salesman problems (Q512957) (← links)
