A fix-and-optimize matheuristic for the k-labelled spanning forest problem

Pinheiro, Tiago F.D.; Ravelo, Santiago Valdés; Buriol, Luciana S.

doi:10.1109/cec55065.2022.9870342

2022 IEEE Congress on Evolutionary Computation (CEC) 2022

DOI: 10.1109/cec55065.2022.9870342

|View full text |Cite

A fix-and-optimize matheuristic for the k-labelled spanning forest problem

Tiago F.D. Pinheiro

Santiago Valdés Ravelo

Luciana S. Buriol

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Solving the minimum labeling global cut problem by mathematical programming

Koehler,

Gouveia,

Sousa Filho

et al. 2024

Int Trans Operational Res

View full text Add to dashboard Cite

An edge‐labeled graph (ELG) is a graph such that is the set of vertices, is the set of edges, is the set of labels (colors), and each edge has a label associated. Given an ELG , the goal of the minimum labeling global cut problem (MLGCP) is to find a subset such that the removal of all edges with labels in disconnects and is minimum. This work proposes three new mathematical formulations for the MLGCP, namely PART, VC, and TE as well as branch‐and‐cut algorithms to solve them. Additionally, a theoretical study was carried out on the MLGCP input graph, leading to the concept of chromatic closure, used in preprocessing algorithms for this model PART. Finally, a comprehensive polyhedral investigation of the model is performed. The computational experiments showed that the model, adopting the chromatic closure concept and its branch‐and‐cut algorithm, can solve small to average‐sized instances in reasonable times.

show abstract

Solving the minimum labeling global cut problem by mathematical programming

Koehler,

Gouveia,

Sousa Filho

et al. 2024

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A fix-and-optimize matheuristic for the k-labelled spanning forest problem

Cited by 1 publication

References 11 publications

Solving the minimum labeling global cut problem by mathematical programming

Solving the minimum labeling global cut problem by mathematical programming

Contact Info

Product

Resources

About