Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
type: Item
instance of: scholarly article
title: Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
zbMATH Open document ID: 1487.90624
author: Rafael A. Melo
author: Michell F. Queiroz
author: Celso C. Ribeiro
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7354040
zbMATH Keywords: metaheuristics
zbMATH Keywords: feedback vertex set
zbMATH Keywords: mixed integer programming
zbMATH Keywords: iterated local search
zbMATH Keywords: matheuristics
describes a project that uses: irace
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.07.006
OpenAlex ID: W3041516214
cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
cites work: Solving the feedback vertex set problem on undirected graphs
cites work: Deadlock resolution in wait-for graphs by vertex/arc deletion
cites work: Lower and upper bounds for the spanning tree with minimum branch vertices
cites work: Minimum Weighted Feedback Vertex Set on Diamonds
cites work: A linear time algorithm for the minimum weighted feedback vertex set on diamonds
cites work: A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
cites work: Q3651735
cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
cites work: Q3835053
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: Q3145802
cites work: A polyhedral approach to the feedback vertex set problem
cites work: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
cites work: Reducibility among Combinatorial Problems
cites work: Wavelength conversion in optical networks
cites work: Minimum energy target tracking with coverage guarantee in wireless sensor networks
cites work: Q4452900
cites work: Q4845371
cites work: Combining simulated annealing with local search heuristics
cites work: Q3981972
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Size bounds for dynamic monopolies
cites work: A matheuristic for the driver scheduling problem with staff cars
cites work: Preface to the Special Issue on Matheuristics: Model‐Based Metaheuristics
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
cites work: The Steiner tree problem with hop constraints
cites work: Feedback vertex sets and cyclically reducible graphs
DOI: 10.1016/J.EJOR.2020.07.006
description: scientific article; zbMATH DE number 7354040