New algorithms for the minimum coloring cut problem

DOI10.1111/ITOR.12494arXiv1703.09258OpenAlexW2604916921MaRDI QIDQ6066619

Thiago Gouveia da Silva, Fábio Protti, Unnamed Author, Unnamed Author

Publication date: 16 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.09258

zbMATH Keywords

combinatorial optimizationgraph theoryvariable neighborhood searchlabel cut problemminimum coloring cut problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

On distance graph coloring problems ⋮ Minimum label \(s\)-\(t\) cut has large integrality gaps ⋮ Refined parameterizations for computing colored cuts in edge-colored graphs ⋮ Colored cut games

Cites Work

• Unnamed Item
• Unnamed Item
• Variable neighborhood search
• On the minimum label spanning tree problem
• The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005.
• Editorial to the Special Cluster on Variable Neighborhood Search, Variants and Recent Applications
• Efficient Algorithms for the Label Cut Problems

This page was built for publication: New algorithms for the minimum coloring cut problem