The parsimonious property of cut covering problems and its applications
type: Item
instance of: scholarly article
title: The parsimonious property of cut covering problems and its applications
zbMATH Open document ID: 0914.90254
DOI: 10.1016/S0167-6377(97)00032-1
published in: Operations Research Letters
publication date: 1998-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1102988
zbMATH Keywords: covering cuts
zbMATH Keywords: Steiner tree
zbMATH Keywords: vehicle routing
zbMATH Keywords: survivable network design
zbMATH Keywords: parsimonious property
author: Dimitris Bertsimas
author: Chung-Piaw Teo
MaRDI profile type: Publication
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q3972951
cites work: Q3138916
cites work: Survivable networks, linear programming relaxations and the parsimonious property
cites work: Q3128880
cites work: Q4763416
cites work: Q4082546
cites work: On some connectivity properties of Eulerian graphs
cites work: Matching theory
cites work: Feasibility of Two Commodity Network Flows
cites work: Q3818127
cites work: Short proofs on multicommodity flows and cuts
cites work: Four-terminus flows
cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application
cites work: A primal-dual approximation algorithm for generalized Steiner network problems
cites work: Heuristic analysis, linear programming and branch and bound
description: scientific article; zbMATH DE number 1102988