The parsimonious property of cut covering problems and its applications (Q1375118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
Normal rank
 
Property / author
 
Property / author: Chung-Piaw Teo / rank
Normal rank
 
Property / author
 
Property / author: Dimitris J. Bertsimas / rank
 
Normal rank
Property / author
 
Property / author: Chung-Piaw Teo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility of Two Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs on multicommodity flows and cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four-terminus flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 28 May 2024

scientific article
Language Label Description Also known as
English
The parsimonious property of cut covering problems and its applications
scientific article

    Statements

    The parsimonious property of cut covering problems and its applications (English)
    0 references
    12 January 1998
    0 references
    covering cuts
    0 references
    Steiner tree
    0 references
    vehicle routing
    0 references
    survivable network design
    0 references
    parsimonious property
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references