SIAM Journal on Discrete Mathematics · 1990 · 144 citations · 10 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsCombinatorial OptimizationGraph AlgorithmsGraph TheoryInteger ProgrammingNetwork OptimizationNetwork TheoryInteger Programming ModelsNetwork Design ProblemsNetwork SurvivabilityPolyhedral CombinatoricsSurvivabilitySurvivability Modeling
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 21 December 1988Accepted: 10 October 1989Published online: 08 August 2006Keywordsnetwork design, network survivability, connectivity, integer programming, polyhedral combinatoricsAMS Subject Headings05C40, 90C27, 90C50Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
10
Matroids and the greedy algorithm
Jack Edmonds · Mathematical Programming · 1971 · 878 citations
Integer Programming and Network Flows.
S. Vajda · Journal of the Operational Research Society · 1970 · 696 citations