A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
From MaRDI portal
Recommendations
Cited in
(19)- Distribution requirements and compactness constraints in school timetabling
- Solution of large weighted equicut problems
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- Greedy randomized adaptive search procedures
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- A GRASP heuristic for the mixed Chinese postman problem
- A multi-objective model for environmental investment decision making
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem
- An improved GRASP based circuit partitioning algorithm
- scientific article; zbMATH DE number 3942929 (Why is no real title available?)
- scientific article; zbMATH DE number 709816 (Why is no real title available?)
- scientific article; zbMATH DE number 1058967 (Why is no real title available?)
- scientific article; zbMATH DE number 2034558 (Why is no real title available?)
- Case-based reasoning and improved adaptive search for project scheduling
- scientific article; zbMATH DE number 2090689 (Why is no real title available?)
- Greedy randomized adaptive search procedures
- 3D geo-graphs: efficient flip verification for the spherical zoning problem
- ``Miniaturized linearizations for quadratic 0/1 problems
This page was built for publication: A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319757)