{"id":"https://openalex.org/W2049892470","doi":"https://doi.org/10.1287/moor.10.3.439","title":"Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm","display_name":"Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm","publication_year":1985,"publication_date":"1985-08-01","ids":{"openalex":"https://openalex.org/W2049892470","doi":"https://doi.org/10.1287/moor.10.3.439","mag":"2049892470"},"language":"en","primary_location":{"id":"doi:10.1287/moor.10.3.439","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.10.3.439","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5102117965","display_name":"Philip M. White","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip M. White","raw_affiliation_strings":["Department of Economics, Princeton University, Princeton, New Jersey 08544"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Economics, Princeton University, Princeton, New Jersey 08544","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058539967","display_name":"Andrew Caplin","orcid":null},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew S. Caplin","raw_affiliation_strings":["Department of Economics, Harvard University, Cambridge, Massachusetts 02138"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Economics, Harvard University, Cambridge, Massachusetts 02138","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074925659","display_name":"Ludo Van der Heyden","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ludo van der Heyden","raw_affiliation_strings":["School of Organization and Management, Yale University, New Haven, Connecticut 06520"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Organization and Management, Yale University, New Haven, Connecticut 06520","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23035577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"3","first_page":"439","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9707000255584717,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9621000289916992,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7883517742156982},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7603334784507751},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7257403135299683},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.691795289516449},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6488503813743591},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5783767700195312},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5532721877098083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5263294577598572},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5168052911758423},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.508480429649353},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4913293421268463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4615035653114319},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.43980351090431213},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4314891993999481},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42885977029800415},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.4138451814651489},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.291315495967865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15467828512191772}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7883517742156982},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7603334784507751},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7257403135299683},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.691795289516449},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6488503813743591},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5783767700195312},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5532721877098083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5263294577598572},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5168052911758423},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.508480429649353},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4913293421268463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4615035653114319},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.43980351090431213},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4314891993999481},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42885977029800415},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.4138451814651489},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.291315495967865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15467828512191772},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1287/moor.10.3.439","is_oa":false,"landing_page_url":"https://doi.org/10.1287/moor.10.3.439","pdf_url":null,"source":{"id":"https://openalex.org/S55826652","display_name":"Mathematics of Operations Research","issn_l":"0364-765X","issn":["0364-765X","1526-5471"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematics of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:inm:ormoor:v:10:y:1985:i:3:p:439-449","is_oa":false,"landing_page_url":"http://doi.org/10.1287/moor.10.3.439","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2020249948","https://openalex.org/W2102721320","https://openalex.org/W2127470768"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W2133667137","https://openalex.org/W2007464938","https://openalex.org/W2784100870","https://openalex.org/W2293098548","https://openalex.org/W2059496069","https://openalex.org/W2158727105","https://openalex.org/W2964424355","https://openalex.org/W2134668949","https://openalex.org/W3116484972"],"abstract_inverted_index":{"Scarf":[0,40,83],"has":[1],"recently":[2],"introduced":[3],"an":[4],"algorithm":[5,41,47],"for":[6,48],"integer":[7,26,32],"programs":[8],"based":[9],"on":[10],"the":[11,21,25,31,39,49,59,64,68,75,82],"combinatorial":[12],"concept":[13],"of":[14,24,77],"primitive":[15,78],"set.":[16],"We":[17],"show":[18],"that":[19,61],"as":[20],"decision":[22],"variables":[23],"program":[27,33],"become":[28],"continuous":[29],"and":[30],"reduces":[34],"to":[35,43],"a":[36,44],"linear":[37,51],"program,":[38],"converges":[42],"dual":[45,69],"simplex":[46,70],"limit":[50,65],"programming":[52],"problem.":[53],"This":[54],"result":[55],"is":[56,66,72],"robust":[57],"in":[58,74],"sense":[60],"even":[62],"before":[63],"reached,":[67],"path":[71,76],"contained":[73],"sets":[79],"generated":[80],"by":[81],"algorithm.":[84]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}