Experimental and Efficient Algorithms
From MaRDI portal
(Redirected from Experimental and Efficient Algorithms)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234657)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234657)
Recommendations
- GRASP with path relinking for the weighted MAXSAT problem
- scientific article; zbMATH DE number 1114001
- GRASP with path-relinking for the TSP
- GRASP with path-relinking for the generalized quadratic assignment problem
- Experimental and Efficient Algorithms
- GRASP and path relinking for the max-min diversity problem
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Revised GRASP with path-relinking for the linear ordering problem
- GRASP: a search algorithm for propositional satisfiability
- GRASP with path relinking heuristics for the antibandwidth problem
Cited in
(10)- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
- TTT plots: a perl program to create time-to-target plots
- A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem
- GRASP with path relinking for three-index assignment
- GRASP with path-relinking for the TSP
- GRASP with path relinking for the weighted MAXSAT problem
- scientific article; zbMATH DE number 1114001 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Restart strategies for GRASP with path-relinking heuristics
This page was built for publication: Experimental and Efficient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710036)