A note on the rainbow cycle cover problem. Issue 1 (10th July 2018)
- Record Type:
- Journal Article
- Title:
- A note on the rainbow cycle cover problem. Issue 1 (10th July 2018)
- Main Title:
- A note on the rainbow cycle cover problem
- Authors:
- Moreno, Jorge
Martins, Simone
Frota, Yuri - Abstract:
- Abstract: Given an edge‐colored graph G, a cycle with all its edges with different colors is called a rainbow cycle. The rainbow cycle cover (RCC) problem consists of finding the minimum number of disjoint rainbow cycles covering G . We present an integer linear programming model for the RCC problem and a reduction process for decreasing the dimensions of the graph, resulting in a more efficient method that was able to find new optimal solutions for instances that were unsolved.
- Is Part Of:
- Networks. Volume 73:Issue 1(2019)
- Journal:
- Networks
- Issue:
- Volume 73:Issue 1(2019)
- Issue Display:
- Volume 73, Issue 1 (2019)
- Year:
- 2019
- Volume:
- 73
- Issue:
- 1
- Issue Sort Value:
- 2019-0073-0001-0000
- Page Start:
- 38
- Page End:
- 47
- Publication Date:
- 2018-07-10
- Subjects:
- branch‐and‐cut -- edge‐colored graph -- graph theory -- integer programming -- preprocessing -- rainbow cycle
Network analysis (Planning) -- Periodicals
658.4032 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0037 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/net.21833 ↗
- Languages:
- English
- ISSNs:
- 0028-3045
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6077.205000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 9280.xml