메뉴 건너뛰기
Operations Research Letters
Volumn 32, Issue 4, 2004, Pages 345-349
A note on hop-constrained walk polytopes
Author keywords

Complete description; Extended formulation; Hop constraints; Walk
Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;
EID: 2042473502     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.10.008     Document Type: Article
Times cited : (14)
References (4)
  • 1
    • 0019647629 scopus 로고
    • The perfect matchable subgraph polytope of a bipartite graph
    • Balas E., Pulleyblank W. The perfect matchable subgraph polytope of a bipartite graph. Networks. 13:1983;495-516.
    • (1983) Networks , vol.13 , pp. 495-516
    • Balas, E.1    Pulleyblank, W.2
  • 2
    • 0032680970 scopus 로고    scopus 로고
    • Notes on polyhedra associated with hop-constrained paths
    • Dahl G. Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25:1999;97-100.
    • (1999) Oper. Res. Lett. , vol.25 , pp. 97-100
    • Dahl, G.1
  • 3
    • 0142242243 scopus 로고    scopus 로고
    • On the directed hop-constrained shortest path problem
    • Dahl G., Gouveia L. On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32:2004;15-22.
    • (2004) Oper. Res. Lett. , vol.32 , pp. 15-22
    • Dahl, G.1    Gouveia, L.2
  • 4
    • 0001276437 scopus 로고    scopus 로고
    • Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
    • Gouveia L. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints. INFORMS J. Comput. 10:1998;180-188.
    • (1998) INFORMS J. Comput. , vol.10 , pp. 180-188
    • Gouveia, L.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.