메뉴 건너뛰기




Volumn 4513 LNCS, Issue , 2007, Pages 324-336

Mixed-integer vertex covers on bipartite graphs

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS; SET THEORY;

EID: 38049074261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_25     Document Type: Conference Paper
Times cited : (9)

References (11)
  • 1
    • 67650000505 scopus 로고    scopus 로고
    • Network formulations of mixed-integer programs
    • In preparation
    • M. Conforti, M. Di Summa, F. Eisenbrand, L.A. Wolsey, Network formulations of mixed-integer programs, In preparation, 2006.
    • (2006)
    • Conforti, M.1    Di Summa, M.2    Eisenbrand, F.3    Wolsey, L.A.4
  • 2
    • 0003348586 scopus 로고
    • Matching: A well-solved class of integer linear programs
    • R.K. Guy, et al, eds, Gordon and Breach, New York
    • J. Edmonds and E.L. Johnson, Matching: a well-solved class of integer linear programs, Combinatorial Structures and Their Applications (R.K. Guy, et al., eds.), Gordon and Breach, New York, 1970, 89-92.
    • (1970) Combinatorial Structures and Their Applications , pp. 89-92
    • Edmonds, J.1    Johnson, E.L.2
  • 3
    • 0002293349 scopus 로고
    • Matching, Euler tours and the Chinese postman
    • J. Edmonds and E.L. Johnson, Matching, Euler tours and the Chinese postman, Mathematical Programming 5 (1973), 88-124.
    • (1973) Mathematical Programming , vol.5 , pp. 88-124
    • Edmonds, J.1    Johnson, E.L.2
  • 4
    • 38049012123 scopus 로고    scopus 로고
    • Mixed Integer Programming over TU systems
    • Manuscript
    • F. Eisenbrand, Mixed Integer Programming over TU systems, Manuscript, 2006.
    • (2006)
    • Eisenbrand, F.1
  • 6
    • 31144458012 scopus 로고    scopus 로고
    • Tight formulations for some simple MIPs and convex objective IPs
    • A. Miller and L.A. Wolsey, Tight formulations for some simple MIPs and convex objective IPs, Mathematical Programming B 98 (2003), 73-88.
    • (2003) Mathematical Programming B , vol.98 , pp. 73-88
    • Miller, A.1    Wolsey, L.A.2
  • 8
    • 34249771073 scopus 로고
    • Polyhedra for lot-sizing with Wagner-Whitin costs
    • Y. Pochet and L.A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Mathematical Programming 67 (1994), 297-324.
    • (1994) Mathematical Programming , vol.67 , pp. 297-324
    • Pochet, Y.1    Wolsey, L.A.2
  • 11
    • 38049010714 scopus 로고    scopus 로고
    • Mixed Integer vertex cover on paths
    • Manuscript
    • M. Skutella, Mixed Integer vertex cover on paths, Manuscript, 2005.
    • (2005)
    • Skutella, M.1


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