{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T12:58:33Z","timestamp":1784984313236,"version":"3.55.0"},"reference-count":10,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4666,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the <jats:italic>k<\/jats:italic>\u2010CARD TREE problem, i.e., the problem of finding in a given undirected graph <jats:italic>G<\/jats:italic> a subtree with <jats:italic>k<\/jats:italic> edges, having minimum weight. Applications of this problem arise in oil\u2010field leasing and facility layout. Although the general problem is shown to be strongly NP hard, it can be solved in polynomial time if <jats:italic>G<\/jats:italic> is itself a tree. We give an integer programming formulation of <jats:italic>k<\/jats:italic>\u2010CARD TREE and an efficient exact separation routine for a set of generalized subtour elimination constraints. The polyhedral structure of the convex hull of the integer solutions is studied. \u00a9 1994 by John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/net.3230240103","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T17:17:59Z","timestamp":1178990279000},"page":"11-21","source":"Crossref","is-referenced-by-count":85,"title":["Weighted <i>k<\/i>\u2010cardinality trees: Complexity and polyhedral structure"],"prefix":"10.1002","volume":"24","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kurt","family":"J\u00f8rnsten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.4.1001"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581274"},{"key":"e_1_2_1_4_2","volume-title":"Computational complexity of some maximum average weight problems with precedence constraints. Memorandum No. 899","author":"Faigle U.","year":"1990"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586946"},{"key":"e_1_2_1_6_2","unstructured":"L. R.FouldsandH. W.Hamacher A new integer programming approach to (restricted) facilities layout problems allowing flexible facility shapes. Report 1992\u20103 Department of Management Systems University of Waikato (1992)."},{"key":"e_1_2_1_7_2","volume-title":"Computers and Intractability: a Guide to the Theory of NP\u2010completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_8_2","unstructured":"H. W.HamacherandK.Joernstern Optimal relinquishments. Technical Report Norwegian School of Economics and Business Administration (1992)."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230030107"},{"key":"e_1_2_1_10_2","unstructured":"F.Maffioli Finding a best subtree of a tree. Rep. no. 91.041. Dip. di Elettronica Politecnico di Milano (1991)."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230240103","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230240103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T23:56:09Z","timestamp":1698105369000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230240103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/net.3230240103"],"URL":"https:\/\/doi.org\/10.1002\/net.3230240103","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}