The 2-path network problem

Networks

Volumn 43, Issue 3, 2004, Pages 190-199

  Dahl, Geir ^a   Johannessen, Bjarne ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

Cutting planes; Network design; Polyhedral approach

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CUTTING PLANES; NETWORK DESIGN; PATH NETWORK; POLYHEDRAL APPROACH;

TELECOMMUNICATION NETWORKS;

EID: 2542615366     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20003     Document Type: Article

References (9)

1. G. Dahl, The 2-hop spanning tree problem, Oper Res Lett 23 (1998), 21-26.
2. G. Dahl, Stable set polytopes for a class of circulant graphs, SIAM J Optimizat 9 (1999), 493-503.
3. G. Dahl and B. Johannessen, The 2-path network problem, Technical report, University of Oslo, Dept. of Informatics, Oslo, Norway, 2000 (see http://www.ifi.uio.no/~geird/index_eng.html).
4. M. Goemans and D. Williamson, A general approximation technique for constrained forest problems, SIAM J Comput 24 (1995), 296-317.
5. L. Gouveia, Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints, INFORMS J Comput 10 (1998), 180-188.
6. M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization, Algorithms and combinatorics, vol. 2, Springer, Berlin, 1988.
7. C. Li, S.T. McCormick, and D. Simchi-Levi, On the minimum-cardinality- bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems, Operat Res Lett 11 (1992), 303-308.
8. G. Nemhauser and L. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
9. A. Schrijver, Theory of linear and integer programming, Wiley, Chichester, 1986.