Critical Extreme Points of the 2-Edge Connected Spanning Subgraph Polytope
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Two-Connected Networks with Rings of Bounded Cardinality
Computational Optimization and Applications
The k edge-disjoint 3-hop-constrained paths polytope
Discrete Optimization
Separation of partition inequalities with terminals
Discrete Optimization
Steiner trees with n terminals among n + 1 nodes
Operations Research Letters
On finding two-connected subgraphs in planar graphs
Operations Research Letters
k-edge connected polyhedra on series-parallel graphs
Operations Research Letters
Design of Survivable Networks Using Three-and Four-Partition Facets
Operations Research
Hi-index | 0.00 |