An optimal strategy for the constrained cycle cover problem
From MaRDI portal
Recommendations
- An optimal strategy for the Constrained Cycle Cover Problem
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
- The bounded cycle-cover problem
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Constant-factor approximations for cycle cover problems
- New approximation algorithms for the minimum cycle cover problem
- New approximation algorithms for the minimum cycle cover problem
- A branch-and-cut algorithm for the maximum covering cycle problem
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Approximation algorithm for min-max cycle cover problem on a mixed graph
Cites work
- A genetic algorithm for the multidimensional knapsack problem
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3967882 (Why is no real title available?)
- scientific article; zbMATH DE number 1183297 (Why is no real title available?)
- scientific article; zbMATH DE number 41029 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
Cited in
(4)
This page was built for publication: An optimal strategy for the constrained cycle cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741265)