DIMACS

The DIMACS Implementation Challenges address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails. Experimentation also brings algorithmic questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data structures. It provides an opportunity to develop and test problem instances, instance generators, and other methods of testing and comparing performance of algorithms. And it is a step in technology transfer by providing leading edge implementations of algorithms for others to adapt. The information on challenges includes pointers to WWW/FTP sites that include calls for participation, algorithm implementations, instance generators, bibliographies, and other electronic artifacts. The challenge organizers are also producing refereed volumes in the AMS-DIMACS book series; these contain selected papers from the workshops that culminate each challenge. If you are using the implementations, generators or other files, please take a few minutes to tell us how you are using it, what applications you are working on, and how it impacts your work. We need to document the impact of this research to the agencies and foundations that support it - your stories are essential to doing that. Send comments to: froberts@dimacs.rutgers.edu


References in zbMATH (referenced in 459 articles )

Showing results 1 to 20 of 459.
Sorted by year (citations)

1 2 3 ... 21 22 23 next

  1. Anderson, Matthew; Williamson, Matthew; Subramani, K.: Empirical analysis of algorithms for the shortest negative cost cycle problem (2019)
  2. Asadi, Soodabeh; Mansouri, Hossein; Darvay, Zsolt; Zangiabadi, Maryam; Mahdavi-Amiri, Nezam: Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (2019)
  3. Džamić, Dušan; Aloise, Daniel; Mladenović, Nenad: Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization (2019)
  4. Feldmann, Andreas Emil: Fixed-parameter approximations for (k)-center problems in low highway dimension graphs (2019)
  5. Furini, Fabio; Ljubić, Ivana; Martin, Sébastien; San Segundo, Pablo: The maximum clique interdiction problem (2019)
  6. Komusiewicz, Christian; Nichterlein, André; Niedermeier, Rolf; Picker, Marten: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (2019)
  7. Lammich, Peter; Sefidgar, S. Reza: Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (2019)
  8. Sedeño-noda, Antonio; Colebrook, Marcos: A biobjective Dijkstra algorithm (2019)
  9. Taillard, Éric D.; Helsgaun, Keld: POPMUSIC for the travelling salesman problem (2019)
  10. Wang, Chi; Jonckheere, Edmond: Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (2019)
  11. Di Puglia Pugliese, Luigi; Gaudioso, Manlio; Guerriero, Francesca; Miglionico, Giovanna: A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (2018)
  12. Feldmann, Andreas Emil; Fung, Wai Shing; Könemann, Jochen; Post, Ian: A ((1+\varepsilon))-embedding of low highway dimension graphs into bounded treewidth graphs (2018)
  13. Gonzaga de Oliveira, Sanderson L.; Bernardes, J. A. B.; Chagas, G. O.: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (2018)
  14. Gonzaga de Oliveira, Sanderson L.; Bernardes, Júnior A. B.; Chagas, Guilherme O.: An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (2018)
  15. Kokosiński, Zbigniew; Bała, Marcin: Solving graph partitioning problems with parallel metaheuristics (2018)
  16. Lu, Yajun; Moradi, Esmaeel; Balasundaram, Balabhaskar: Correction to: “Finding a maximum (k)-club using the (k)-clique formulation and canonical hypercube cuts” (2018)
  17. Marques-Silva, Joao; Malik, Sharad: Propositional SAT solving (2018)
  18. Moradi, Esmaeel; Balasundaram, Balabhaskar: Finding a maximum (k)-club using the (k)-clique formulation and canonical hypercube cuts (2018)
  19. Orden, David; Gimenez-Guzman, Jose Manuel; Marsa-Maestre, Ivan; de la Hoz, Enrique: Spectrum graph coloring and applications to Wi-Fi channel assignment (2018)
  20. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)

1 2 3 ... 21 22 23 next