A branch-and-cut algorithm for the maximum covering cycle problem
DOI10.1007/S10479-018-2856-5zbMATH Open1435.90119OpenAlexW2797687485WikidataQ129994048 ScholiaQ129994048MaRDI QIDQ2288980FDOQ2288980
Authors: Eduardo Álvarez-Miranda, Markus Sinnl 
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2856-5
Recommendations
- Branch-and-cut algorithms for the covering salesman problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Approximation Algorithms for Min-Max Cycle Cover Problems
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
- An exact algorithm for the maximal covering problem
- Searching for a cycle with maximum coverage in undirected graphs
- A branch and bound algorithm for the maximum clique problem
- A branch and bound algorithm for the maximum clique problem
- On approximating maximum covering cycles in undirected graphs
- Approximation algorithm for min-max cycle cover problem on a mixed graph
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Solving Steiner tree problems in graphs to optimality
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Title not available (Why is that?)
- Solution of a Large-Scale Traveling-Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- The median tour and maximal covering tour problems: Formulations and heuristics
- The Covering Tour Problem
- Solving the Orienteering Problem through Branch-and-Cut
- The Covering Salesman Problem
- MIP models for connected facility location: a theoretical and computational study
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
- The generalized covering salesman problem
- Searching for a cycle with maximum coverage in undirected graphs
- The bi-objective covering tour problem
- Approximation algorithms for the Geometric Covering Salesman Problem
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- Title not available (Why is that?)
- Permutation graphs: Connected domination and Steiner trees
- An algorithmic framework for the exact solution of tree-star problems
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
- A node-based ILP formulation for the node-weighted dominating Steiner problem
Cited In (11)
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- An optimal strategy for the constrained cycle cover problem
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
- Minimum constellation covers: hardness, approximability and polynomial cases
- Covering a graph with cycles.
- A branch-and-cut algorithm for the plant-cycle location problem
- An exact algorithm for the maximal covering problem
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Searching for a cycle with maximum coverage in undirected graphs
- Branch-and-cut algorithms for the covering salesman problem
Uses Software
This page was built for publication: A branch-and-cut algorithm for the maximum covering cycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288980)
