{"id":"https://openalex.org/W1993986344","doi":"https://doi.org/10.1007/bf01582057","title":"A technique for speeding up the solution of the Lagrangean dual","display_name":"A technique for speeding up the solution of the Lagrangean dual","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1993986344","doi":"https://doi.org/10.1007/bf01582057","mag":"1993986344"},"language":"en","primary_location":{"id":"doi:10.1007/bf01582057","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582057","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/5091/1/OR-248-91-23661133.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025940525","display_name":"Dimitris Bertsimas","orcid":"https://orcid.org/0000-0002-1985-1003"},"institutions":[{"id":"https://openalex.org/I1334819555","display_name":"Memorial Sloan Kettering Cancer Center","ror":"https://ror.org/02yrq0923","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1334819555"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitris Bertsimas","raw_affiliation_strings":["Sloan School of Management, E53-359, MIT, 50 Memorial Drive, 02139, Cambridge, MA, USA","Sloan School of Management, E53-359, MIT, Cambridge, USA 02139#TAB#"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, E53-359, MIT, 50 Memorial Drive, 02139, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1334819555"]},{"raw_affiliation_string":"Sloan School of Management, E53-359, MIT, Cambridge, USA 02139#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I1334819555","display_name":"Memorial Sloan Kettering Cancer Center","ror":"https://ror.org/02yrq0923","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1334819555"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Sloan School of Management, E53-359, MIT, 50 Memorial Drive, 02139, Cambridge, MA, USA","Sloan School of Management, E53-359, MIT, Cambridge, USA 02139#TAB#"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, E53-359, MIT, 50 Memorial Drive, 02139, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1334819555"]},{"raw_affiliation_string":"Sloan School of Management, E53-359, MIT, Cambridge, USA 02139#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025940525"],"corresponding_institution_ids":["https://openalex.org/I1334819555"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.7009,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.94919896,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"63","issue":"1-3","first_page":"23","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7402205467224121},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7148469686508179},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.6191020607948303},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.587101399898529},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5838286280632019},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5309177041053772},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5051539540290833},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5001158714294434},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4953523874282837},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.48594367504119873},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48142024874687195},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.46515709161758423},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.43777117133140564},{"id":"https://openalex.org/keywords/transportation-theory","display_name":"Transportation theory","score":0.4325448274612427},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.42264169454574585},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.41189679503440857},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.26970919966697693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10441958904266357}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7402205467224121},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7148469686508179},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.6191020607948303},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.587101399898529},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5838286280632019},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5309177041053772},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5051539540290833},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5001158714294434},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4953523874282837},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.48594367504119873},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48142024874687195},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.46515709161758423},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.43777117133140564},{"id":"https://openalex.org/C31829261","wikidata":"https://www.wikidata.org/wiki/Q1929885","display_name":"Transportation theory","level":2,"score":0.4325448274612427},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.42264169454574585},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.41189679503440857},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.26970919966697693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10441958904266357},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/bf01582057","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582057","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/5091","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5091","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/5091/1/OR-248-91-23661133.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},{"id":"pmh:ADA459506","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA459506","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.8602","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.8602","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/dbertsim/www/papers/Optimization/A%20technique%20for%20speeding%20up%20the%20solution%20of%20the%20Lagrangean%20dual.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.7909","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/2349/1/SWP-3278-23661133.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.9945","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.9945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/5091/1/OR-248-91-23661133.pdf","raw_type":"text"},{"id":"pmh:oai:RePEc:mit:sloanp:2349","is_oa":false,"landing_page_url":"http://hdl.handle.net/1721.1/2349","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":null,"raw_type":"preprint"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/5091","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5091","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/5091/1/OR-248-91-23661133.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4198818893","display_name":"Probabilistic and Dynamic Combinatorial Optimization        Problems","funder_award_id":"9014751","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5059657817","display_name":"New Directions in Network Flows","funder_award_id":"8921835","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309015","display_name":"Charles Stark Draper Laboratory","ror":"https://ror.org/04378d909"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1993986344.pdf","grobid_xml":"https://content.openalex.org/works/W1993986344.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W5720473","https://openalex.org/W1530075571","https://openalex.org/W1579943307","https://openalex.org/W1964286413","https://openalex.org/W1964399289","https://openalex.org/W1968143987","https://openalex.org/W1980869082","https://openalex.org/W2009803313","https://openalex.org/W2017697298","https://openalex.org/W2020163691","https://openalex.org/W2033791397","https://openalex.org/W2035144082","https://openalex.org/W2056991815","https://openalex.org/W2057672746","https://openalex.org/W2058748455","https://openalex.org/W2063682953","https://openalex.org/W2069291005","https://openalex.org/W2075322358","https://openalex.org/W2080063509","https://openalex.org/W2080656989","https://openalex.org/W2081055047","https://openalex.org/W2099103397","https://openalex.org/W2100440346","https://openalex.org/W2103263531","https://openalex.org/W2104103056","https://openalex.org/W2107474910","https://openalex.org/W2108303241","https://openalex.org/W2114552889","https://openalex.org/W2121012222","https://openalex.org/W2134422938","https://openalex.org/W2159739530","https://openalex.org/W2167539320","https://openalex.org/W2171985270","https://openalex.org/W3139666781","https://openalex.org/W4236384091","https://openalex.org/W4242130683","https://openalex.org/W6664753575","https://openalex.org/W6669469299"],"related_works":["https://openalex.org/W2072075444","https://openalex.org/W2513180016","https://openalex.org/W2999369551","https://openalex.org/W2038141985","https://openalex.org/W2142695913","https://openalex.org/W2109445739","https://openalex.org/W2021079478","https://openalex.org/W2130312263","https://openalex.org/W2161798622","https://openalex.org/W2559385861"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}