Polyhedral intersection theorem for capacitated spanning trees

被引：0

|

作者：

Hall, Leslie A.

Magnanti, Thomas L.

机构：

来源：

Mathematics of Operations Research | 1992年 / 17卷 / 02期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

相关论文

共 50 条

[1] A POLYHEDRAL INTERSECTION THEOREM FOR CAPACITATED SPANNING-TREES
HALL, LA
MAGNANTI, TL
MATHEMATICS OF OPERATIONS RESEARCH, 1992, 17 (02) : 398 - 410
[2] FOREST COVERS AND A POLYHEDRAL INTERSECTION THEOREM
GAMBLE, AB
PULLEYBLANK, WR
MATHEMATICAL PROGRAMMING, 1989, 45 (01) : 49 - 58
[3] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Gabow, HN
Manu, KS
MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 83 - 109
[4] Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Harold N. Gabow
K. S. Manu
Mathematical Programming, 1998, 82 : 83 - 109
[5] Intersection of random spanning trees in complex networks
András London
András Pluhár
Applied Network Science, 8
[6] Intersection of random spanning trees in complex networks
London, Andras
Pluhar, Andras
APPLIED NETWORK SCIENCE, 2023, 8 (01)
[7] A unified existence theorem for normal spanning trees
Pitz, Max
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 145 : 466 - 469
[8] Sequences of spanning trees and a fixed tree theorem
Aichholzer, O
Aurenhammer, F
Hurtado, F
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 21 (1-2): : 3 - 20
[9] Determinant of links, spanning trees, and a theorem of Shank
Ge, Jun
Zhang, Lianzhu
JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, 2016, 25 (09)
[10] Polyhedral results and stronger Lagrangean bounds for stable spanning trees
Samer, Phillippe
Haugland, Dag
OPTIMIZATION LETTERS, 2023, 17 (06) : 1317 - 1335

← 1 2 3 4 5 →