The Bounded Cycle-Cover Problem

DOI10.1287/ijoc.13.2.104.10516zbMath1238.90131OpenAlexW2036247514MaRDI QIDQ2884498

Eli V. Olinick, Dorit S. Hochbaum

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

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

Related Items (4)

An overview of graph covering and partitioning ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ A directed cycle-based column-and-cut generation method for capacitated survivable network design ⋮ Profitable mixed capacitated arc routing and related problems

This page was built for publication: The Bounded Cycle-Cover Problem