Publication | Closed Access

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs

Mathematical ProgrammingNetwork ScienceGraph TheoryEngineeringNetwork AlgorithmStructural Graph TheoryExtremal Graph TheoryCombinatorial ProblemPrize-collecting Steiner ProblemNetwork AnalysisEducationDiscrete MathematicsCombinatorial OptimizationGraph AlgorithmSocial Network Analysis