Efficient Iterated Greedy for the Two-Dimensional Bandwidth Minimization Problem
This research has been partially supported by the Ministerio de Ciencia, Innovación y Universidades (Grant Ref. PGC2018-095322-B-C22, PID2021-125709OA-C22 and FPU19/04098) and by the Comunidad de Madrid and the European Regional Development Fund (Grant Ref. P2018/TCS-4566). We also thank M.A. Rodrgu...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2022 |
| País: | España |
| Institución: | Universidad Rey Juan Carlos |
| Repositorio: | BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos |
| OAI Identifier: | oai:burjcdigital.urjc.es:10115/24471 |
| Acceso en línea: | https://hdl.handle.net/10115/24471 |
| Access Level: | acceso abierto |
| Palabra clave: | Heuristics Graph layout problem Iterated greedy Combinatorial optimization Bandwidth |
| Sumario: | This research has been partially supported by the Ministerio de Ciencia, Innovación y Universidades (Grant Ref. PGC2018-095322-B-C22, PID2021-125709OA-C22 and FPU19/04098) and by the Comunidad de Madrid and the European Regional Development Fund (Grant Ref. P2018/TCS-4566). We also thank M.A. Rodrguez et al., authors of the previous most competitive method in the state of the art Rodríguez-García et al. (2021) for sharing their code with us. |
|---|