{"id":"https://openalex.org/W2189041580","doi":null,"title":"A Set Theoretic Approach to Lifting Procedures for 0,1 Integer Programming","display_name":"A Set Theoretic Approach to Lifting Procedures for 0,1 Integer Programming","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2189041580","mag":"2189041580"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.4980","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.4980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieor.columbia.edu/~dano/research/theses/zuckerberg.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065684245","display_name":"Mark Zuckerberg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Zuckerberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5065684245"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3896,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.58214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8471999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8471999764442444,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.14030000567436218,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lifting-procedure","display_name":"lifting procedure","score":0.7990000247955322},{"id":"https://openalex.org/keywords/0-1-integer-programming","display_name":"0-1 integer programming","score":0.9639999866485596},{"id":"https://openalex.org/keywords/set-theoretic-methods","display_name":"set-theoretic methods","score":0.6309999823570251},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.6389999985694885},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"set covering problem","score":0.9100000262260437},{"id":"https://openalex.org/keywords/linear-constraints","display_name":"linear constraints","score":0.3330000042915344}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7085714936256409},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6485426425933838},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6137322187423706},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.471329927444458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4398185610771179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41086500883102417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.299968421459198},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19192197918891907}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.4980","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.4980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieor.columbia.edu/~dano/research/theses/zuckerberg.pdf","raw_type":"text"},{"id":"mag:2189041580","doi":null,"is_oa":false,"landing_page_url":"http://www.columbia.edu/~dano/theses/zuckerberg.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1607580485","https://openalex.org/W1963547452","https://openalex.org/W1970193303","https://openalex.org/W2011805810","https://openalex.org/W2040661328","https://openalex.org/W2049143039","https://openalex.org/W2067178640","https://openalex.org/W2072344787","https://openalex.org/W2074078071","https://openalex.org/W2077397558","https://openalex.org/W2097415784","https://openalex.org/W2100440346","https://openalex.org/W2101620967","https://openalex.org/W2106264302","https://openalex.org/W2146471456","https://openalex.org/W2167508847"],"related_works":["https://openalex.org/W2187930740","https://openalex.org/W2068848618","https://openalex.org/W2112538451","https://openalex.org/W7099087293","https://openalex.org/W2508114100","https://openalex.org/W2908417348","https://openalex.org/W1481126596","https://openalex.org/W1999735208","https://openalex.org/W2475459382","https://openalex.org/W1985990685"],"abstract_inverted_index":{"A":[0],"new":[1,64,110],"lifting":[2,39,66,104],"procedure":[3],"for":[4,72,128],"0,":[5,73],"1":[6,74],"integer":[7,75],"programming":[8,76],"problems":[9],"is":[10,35,78,126,153],"introduced":[11],"in":[12,30,96,140,167],"which":[13],"vari-ables":[14],"are":[15,166],"appended":[16],"to":[17,19,112,155],"correspond":[18],"each":[20,149],"logical":[21],"statement":[22],"that":[23,37,54,77,98,127],"can":[24],"be":[25],"made":[26],"about":[27],"the":[28,31,41,58,83,87,102,113,116,134,161],"vectors":[29],"feasible":[32,117,162],"region.":[33],"It":[34],"shown":[36],"this":[38],"generalizes":[40],"liftings":[42],"of":[43,60,101,109,115,123,131,146,150],"Sherali":[44],"and":[45,48,50,53],"Adams":[46],"[SA90]":[47],"Lov\u00e1sz":[49],"Schrijver":[51],"[LS91],":[52],"its":[55],"features":[56,59],"generalize":[57],"those":[61],"liftings.":[62,89],"The":[63],"larger":[65,103],"provides":[67],"a":[68,143],"broader":[69],"conceptual":[70],"framework":[71],"only":[79],"incompletely":[80],"exploited":[81],"by":[82,105],"techniques":[84],"based":[85],"on":[86,160],"older":[88],"We":[90],"suggest":[91],"several":[92],"polynomial":[93,141,147],"time":[94,142],"algorithms":[95,125],"particular":[97],"take":[99],"advantage":[100],"tailoring":[106],"their":[107],"choice":[108],"variables":[111],"structure":[114],"set":[118,163],"itself.":[119],"One":[120],"notable":[121],"feature":[122],"these":[124],"large":[129],"classes":[130],"problems,":[132],"including":[133],"\u201cSet":[135],"Covering":[136],"Problem\u201d,":[137],"they":[138],"produce":[139],"linear":[144,158],"system":[145],"size":[148],"whose":[151,164],"solutions":[152],"guaranteed":[154],"satisfy":[156],"all":[157],"constraints":[159],"coefficients":[165],"{0,":[168],"1,...,":[169],"k}.":[170]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}