{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:56Z","timestamp":1759063796018},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,9,1]],"date-time":"2001-09-01T00:00:00Z","timestamp":999302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4337,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,9]]},"DOI":"10.1016\/s0166-218x(00)00307-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:07:57Z","timestamp":1027616877000},"page":"11-26","source":"Crossref","is-referenced-by-count":3,"title":["Discrete relaxations of combinatorial programs"],"prefix":"10.1016","volume":"112","author":[{"given":"Ralf","family":"Bornd\u00f6rfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00307-3_BIB1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1137\/0402038","article-title":"The asymmetric assignment problem and some new facets of the travelling salesman polytope on a directed graph","volume":"3","author":"Balas","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00307-3_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","article-title":"The perfectly matchable subgraph polytope of an arbitrary graph","volume":"9","author":"Balas","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB3","series-title":"Set Packing Relaxations of Some Integer Programs, Preprint SC 97-30","author":"Bornd\u00f6rfer","year":"1997"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02592196","article-title":"{0,12}-Chv\u00e1tal-Gomory cuts","volume":"74","author":"Caprara","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","article-title":"The steiner tree problem I: Formulations, compositions, and extensions of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01582574","article-title":"The steiner tree problem II: Properties and classes of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1975","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01582277","article-title":"On the 0,1 facets of the set covering polytope","volume":"43","author":"Cornu\u00e9jols","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02592198","article-title":"Formulations and valid inequalities for node capacitated graph partitioning","volume":"74","author":"Ferreira","year":"1996","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB10","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","article-title":"(1,k)-Configurations and facets for packing problems","volume":"18","author":"Padberg","year":"1980","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","article-title":"An analytical comparison of different formulations of the travelling salesman problem","volume":"52","author":"Padberg","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB14","unstructured":"W.R. Pulleyblank, F.B. Shepherd, Formulations for the stable set polytope of a claw-free graph, Proceedings of the third International IPCO Conference, 1993, pp. 267\u2013279."},{"key":"10.1016\/S0166-218X(00)00307-3_BIB15","first-page":"243","article-title":"A note on node packing polytopes on hypergraphs","volume":"2","author":"Sekiguchi","year":"1983","journal-title":"OR Letters"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02614517","article-title":"On the 0\/1 Knapsack polytope","volume":"77","author":"Weismantel","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(00)00307-3_BIB17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","article-title":"Valid inequalities for 0\u20131 Knapsacks and MIPs with generalized upper bound constraints","volume":"29","author":"Wolsey","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00307-3_BIB18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Faces of linear inequalities in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003073?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003073?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:59:07Z","timestamp":1555768747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,9]]}},"alternative-id":["S0166218X00003073"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00307-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,9]]}}}