메뉴 건너뛰기




Volumn 34, Issue 4, 2010, Pages 1042-1050

Solving a cut problem in bipartite graphs by linear programming: Application to a forest management problem

Author keywords

Bipartite graph; Cut; Experiments; Land allocation modelling; Linear programming; Wildlife habitat

Indexed keywords

BIPARTITE GRAPH; BIPARTITE GRAPHS; COMPUTATIONAL RESULTS; FOREST MANAGEMENT; LAND ALLOCATION; LAND AREAS; LINEAR PROGRAMS; MATRIX; MAX-CUT PROBLEM; OLD GROWTH; REAL VARIABLES; SQUARE CELL; STANDARD ALGORITHMS; WEIGHTED SUM; WILDLIFE HABITATS;

EID: 71849120177     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2009.07.014     Document Type: Article
Times cited : (9)

References (26)
  • 4
    • 39149089471 scopus 로고    scopus 로고
    • Weintraub A., Romero C., Bjorndal T., and Epstein R. (Eds), Springer
    • In: Weintraub A., Romero C., Bjorndal T., and Epstein R. (Eds). Handbook of Operations Research in Natural Resources (2007), Springer
    • (2007) Handbook of Operations Research in Natural Resources
  • 8
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Miller R.E., and Thatcher J.W. (Eds), Plenum Press
    • Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 11
    • 0018052098 scopus 로고
    • Node- and edge-selection NP-complete problems
    • Association for Computing Machinery, New York
    • Yannakakis M. Node- and edge-selection NP-complete problems. Proc. 10th Ann. ACM Symp. on Theory of Computing (1978), Association for Computing Machinery, New York 253-264
    • (1978) Proc. 10th Ann. ACM Symp. on Theory of Computing , pp. 253-264
    • Yannakakis, M.1
  • 12
    • 84893574327 scopus 로고
    • Improved approximation algorithms for MAX-CUT and satisfiability problems using semidefinite programming
    • Goemans M., and Williamson D.P. Improved approximation algorithms for MAX-CUT and satisfiability problems using semidefinite programming. J. ACM 42 (1995) 1115-1145
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Goemans, M.1    Williamson, D.P.2
  • 13
    • 71849106239 scopus 로고    scopus 로고
    • Maximum cut problem, MAX-CUT
    • C.A. Floudas, P.M. Pardalos Eds, second ed, Springer
    • C.W. Commander, Maximum cut problem, MAX-CUT, in: C.A. Floudas, P.M. Pardalos (Eds.), Encyclopedia of Optimization, second ed., Springer, 2009, 1991-1999.
    • (2009) Encyclopedia of Optimization , pp. 1991-1999
    • Commander, C.W.1
  • 14
    • 0002068485 scopus 로고
    • Finding the maximal cut in a graph
    • Orlova G.I., and Dorfman Y.G. Finding the maximal cut in a graph. Eng. Cybernet. 10 (1972) 502-504
    • (1972) Eng. Cybernet. , vol.10 , pp. 502-504
    • Orlova, G.I.1    Dorfman, Y.G.2
  • 15
    • 0000120312 scopus 로고
    • Finding a maximum cut of a planar graph in polynomial time
    • Hadlock F.O. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 (1975) 221-225
    • (1975) SIAM J. Comput. , vol.4 , pp. 221-225
    • Hadlock, F.O.1
  • 16
    • 0019627062 scopus 로고
    • Weakly bipartite graphs and the max-cut problem
    • Grotschel M., and Pulleyblank W.R. Weakly bipartite graphs and the max-cut problem. Operat. Res. Lett. 1 (1981) 23-27
    • (1981) Operat. Res. Lett. , vol.1 , pp. 23-27
    • Grotschel, M.1    Pulleyblank, W.R.2
  • 18
    • 57049162750 scopus 로고
    • The MAX-CUT problem: a survey. Special Year in Combinatorial Optimization
    • Cook W., Lovasz L., and Seymour P. (Eds), American Mathematical Society
    • Poljak S., and Tuza Z. The MAX-CUT problem: a survey. Special Year in Combinatorial Optimization. In: Cook W., Lovasz L., and Seymour P. (Eds). DIMACS Series in Discrete Mathematics and Computer Science (1995), American Mathematical Society
    • (1995) DIMACS Series in Discrete Mathematics and Computer Science
    • Poljak, S.1    Tuza, Z.2
  • 19
    • 71849115999 scopus 로고    scopus 로고
    • H.L. Bodlaender, K. Jansen, On the Complexity of the Maximum Cut Problem, 1993 (manuscript).
    • H.L. Bodlaender, K. Jansen, On the Complexity of the Maximum Cut Problem, 1993 (manuscript).
  • 20
    • 31244435415 scopus 로고    scopus 로고
    • Pseudo-Boolean optimization
    • Boros E., and Hammer P.L. Pseudo-Boolean optimization. Discr. Appl. Math. 123 (2002) 155-225
    • (2002) Discr. Appl. Math. , vol.123 , pp. 155-225
    • Boros, E.1    Hammer, P.L.2
  • 22
    • 71849084854 scopus 로고    scopus 로고
    • Solving MAX-CUT to optimality by intersecting semidefinite and polyhedral relaxations, Math. Program
    • 22 July
    • F. Rendl, R. Giovanni, A. Wiegele, Solving MAX-CUT to optimality by intersecting semidefinite and polyhedral relaxations, Math. Program., Published Online: 22 July 2008.
    • (2008) Published Online
    • Rendl, F.1    Giovanni, R.2    Wiegele, A.3


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