Efficient heuristics for the minimum labeling global cut problem

DOI10.1016/j.endm.2018.03.004zbMath1408.90336OpenAlexW2797445847MaRDI QIDQ1791898

Luiz Satoru Ochi, Gilberto F. de Sousa Filho, Thiago Gouveia da Silva, Daniel Aloise, Igor A. M. Barbosa, Lucidio A. F. Cabral, Nenad Mladenović

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.004

zbMATH Keywords

connectivityvariable neighborhood searchedge-labeled graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Variable neighbourhood search: methods and applications
• Approximating Minimum Label s-t Cut via Linear Programming
• Efficient Algorithms for the Label Cut Problems

This page was built for publication: Efficient heuristics for the minimum labeling global cut problem