The following pages link to DIMACS (Q20231):
Displaying 27 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- SAT race 2015 (Q334795) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Generating new test instances by evolving in instance space (Q342041) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- On the first-order estimation of multipliers from Kuhn-Tucker systems (Q1592583) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- Iterated greedy for the maximum diversity problem (Q2275623) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- The Open Graph Archive: A Community-Driven Effort (Q3223978) (← links)
- Towards a theory of practice in metaheuristics design: A machine learning perspective (Q3431446) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
- Graph Partitioning and Graph Clustering (Q4917013) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Reorganizing topologies of Steiner trees to accelerate their eliminations (Q5216441) (← links)
- Customizable Contraction Hierarchies (Q5266613) (← links)
- Theory and Applications of Satisfiability Testing (Q5325865) (← links)
- Bounded model checking using satisfiability solving (Q5946344) (← links)
