The bounded cycle-cover problem

DOI10.1287/IJOC.13.2.104.10516MaRDI QIDQ2884498zbMATH OpenOpenAlexFDO

Authors Dorit S. Hochbaum, Eli V. Olinick

Publication date 30 May 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ce6441bc128d0c128afd40562ec3c478f781cadd

zbMATH Keywords

analysis of algorithmsnetworks-graphs heuristics

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Covering a graph with cycles.
• An optimal strategy for the constrained cycle cover problem
• An optimal strategy for the Constrained Cycle Cover Problem
• Constrained Cycle Covers in Halin Graphs
• STACS 2005

Cited in

(12)

• Covering a graph with cycles.
• An optimal strategy for the Constrained Cycle Cover Problem
• Lane covering with partner bounds in collaborative truckload transportation procurement
• An overview of graph covering and partitioning
• Profitable mixed capacitated arc routing and related problems
• An optimal strategy for the constrained cycle cover problem
• On DRC covering -- a survey
• Constrained Cycle Covers in Halin Graphs
• On Approximating Restricted Cycle Covers
• A directed cycle-based column-and-cut generation method for capacitated survivable network design
• scientific article; zbMATH DE number 1555925 (Why is no real title available?)
• Bounded Cycle Synthesis

This page was built for publication: The bounded cycle-cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884498)