Arc routing problems with scheduling and covering constraints
Constructive and improvement algorithms to the single machine scheduling problems ...
Occupational Therapy collaborative consulting in autism for municipal public schoo...
| Full text | |
| Author(s): |
Rodrigues, Marcos Okamura
[1]
Total Authors: 1
|
| Affiliation: | [1] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Ave Trabalhador Sao Carlense 400, BR-13566590 Sao Carlos, SP - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | DISCRETE OPTIMIZATION; v. 39, FEB 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
The edge clique covering problem consists in covering the edges of a graph using the minimum number of cliques. The problem is NP-hard and even state-of-the-art heuristic methods may have prohibitive runtime or obtain low quality solutions. This paper proposes fast and better constructive and improvement heuristics for the problem. Computational experiments show the proposed heuristics can find better solutions in few seconds for most instances. Tests were run on edge clique covering, DIMACS and BHOSLIB instances. (C) 2021 Elsevier B.V. All rights reserved. (AU) | |
| FAPESP's process: | 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry |
| Grantee: | Francisco Louzada Neto |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 14/23900-0 - Irregular and quasi-polyomino cutting and packing problems |
| Grantee: | Marcos Okamura Rodrigues |
| Support Opportunities: | Scholarships in Brazil - Doctorate |