Minimizing cyclic cutwidth of graphs using a memetic algorithm
Author
Abstract
Suggested Citation
DOI: 10.1007/s10732-016-9319-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Juan Pantrigo & Rafael Martí & Abraham Duarte & Eduardo Pardo, 2012. "Scatter search for the cutwidth minimization problem," Annals of Operations Research, Springer, vol. 199(1), pages 285-304, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Mu He & Qinghua Wu & Yongliang Lu, 2022. "Breakout local search for the cyclic cutwidth minimization problem," Journal of Heuristics, Springer, vol. 28(5), pages 583-618, December.
- Sergio Cavero & Eduardo G. Pardo & Abraham Duarte, 2022. "A general variable neighborhood search for the cyclic antibandwidth problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 657-687, March.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Eduardo G. Pardo & Antonio García-Sánchez & Marc Sevaux & Abraham Duarte, 2020. "Basic variable neighborhood search for the minimum sitting arrangement problem," Journal of Heuristics, Springer, vol. 26(2), pages 249-268, April.
- Miguel A. González & Juan José Palacios & Camino R. Vela & Alejandro Hernández-Arauzo, 2017. "Scatter search for minimizing weighted tardiness in a single machine scheduling with setups," Journal of Heuristics, Springer, vol. 23(2), pages 81-110, June.
- Abraham Duarte & Juan Pantrigo & Eduardo Pardo & Nenad Mladenovic, 2015. "Multi-objective variable neighborhood search: an application to combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 63(3), pages 515-536, November.
- Santos, Vinícius Gandra Martins & Carvalho, Marco Antonio Moreira de, 2021. "Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem," European Journal of Operational Research, Elsevier, vol. 289(3), pages 1056-1066.
More about this item
Keywords
Cyclic cutwidth; Memetic algorithm; Graph layout problems;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joheur:v:22:y:2016:i:6:d:10.1007_s10732-016-9319-4. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.