Searching for a cycle with maximum coverage in undirected graphs
type: Item
instance of: scholarly article
title: Searching for a cycle with maximum coverage in undirected graphs
zbMATH Open document ID: 1355.90083
author: Andrea Grosso
author: Fabio Salassa
author: Wim Vancroonenburg
published in: Optimization Letters
publication date: 2016-10-27T00:00:00Z
full work available at URL: http://hdl.handle.net/2318/1622326
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6644662
zbMATH Keywords: maximum covering cycle
zbMATH Keywords: constraint generation
zbMATH Keywords: integer programming
zbMATH Keywords: heuristics
MaRDI profile type: Publication
OpenAlex ID: W2240776925
cites work: Finding minimum dominating cycles in permutation graphs
cites work: The Covering Salesman Problem
cites work: Local branching
cites work: Solving connected dominating set faster than \(2^n\)
cites work: The Covering Tour Problem
cites work: The generalized covering salesman problem
cites work: Approximation algorithms for connected dominating sets
cites work: On dominating and spanning circuits in graphs
cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
cites work: On Spanning and Dominating Circuits in Graphs
cites work: Generating subtour elimination constraints for the TSP from pure integer solutions
cites work: Existence of dominating cycles and paths
DOI: 10.1007/S11590-015-0952-X
description: scientific article; zbMATH DE number 6644662