Two-phase GRASP for the multi-constraint graph partitioning problem
From MaRDI portal
Cites work
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment
- An exact approach for the multi-constraint graph partitioning problem
- Finding good approximate vertex and edge partitions is NP-hard
- Graph partitioning based methods and tools for scientific computing
- Graph partitioning models for parallel computing
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- LocalSolver 1.x: A black-box local-search solver for 0-1 programming
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The partition problem
- VLSI physical design. From graph partitioning to timing closure
Cited in
(2)
This page was built for publication: Two-phase GRASP for the multi-constraint graph partitioning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974959)
