Searching for a cycle with maximum coverage in undirected graphs

DOI10.1007/s11590-015-0952-xzbMath1355.90083OpenAlexW2240776925MaRDI QIDQ331987

Wim Vancroonenburg, Andrea Grosso, Fabio Salassa

Publication date: 27 October 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2318/1622326

zbMATH Keywords

heuristicsinteger programmingconstraint generationmaximum covering cycle

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ On approximating maximum covering cycles in undirected graphs ⋮ A branch-and-cut algorithm for the maximum covering cycle problem

Cites Work

• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Solving connected dominating set faster than \(2^n\)
• Finding minimum dominating cycles in permutation graphs
• Existence of dominating cycles and paths
• On dominating and spanning circuits in graphs
• Approximation algorithms for connected dominating sets
• Local branching
• Generating subtour elimination constraints for the TSP from pure integer solutions
• The Generalized Covering Salesman Problem
• On Spanning and Dominating Circuits in Graphs
• The Covering Tour Problem
• The Covering Salesman Problem

This page was built for publication: Searching for a cycle with maximum coverage in undirected graphs