A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing Export

@article{citeulike:2211854, abstract = {We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities. Computational results are reported.}, author = {Nemhauser, G. L. and Sigismondi, G.}, citeulike-article-id = {2211854}, citeulike-linkout-0 = {http://www.jstor.org/stable/2583564}, journal = {The Journal of the Operational Research Society}, keywords = {algorithms, branch-and-bound, cutting-plane, forestry, graph, harvest, node, packing}, number = {5}, pages = {443--457}, posted-at = {2008-01-09 18:57:09}, priority = {5}, title = {A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing}, url = {http://www.jstor.org/stable/2583564}, volume = {43}, year = {1992} }

TY - JOUR ID - citeulike:2211854 L3 - citeulike-article-id:2211854 N2 - We present a strong cutting plane/branch-and-bound algorithm for node packing. The cutting planes are obtained from cliques and lifting odd hole inequalities. Computational results are reported. IS - 5 JF - The Journal of the Operational Research Society EP - 457 TI - A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing VL - 43 SP - 443 KW - algorithms KW - branch-and-bound KW - cutting-plane KW - forestry KW - graph KW - harvest KW - node KW - packing AU - Nemhauser, GL AU - Sigismondi, G PY - 1992/// UR - http://www.jstor.org/stable/2583564 ER -