{"id":"https://openalex.org/W2165775468","doi":"https://doi.org/10.1007/s10107-003-0396-4","title":"Robust discrete optimization and network flows","display_name":"Robust discrete optimization and network flows","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2165775468","doi":"https://doi.org/10.1007/s10107-003-0396-4","mag":"2165775468"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0396-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0396-4","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitris Bertsimas","raw_affiliation_strings":["Boeing Professor of Operations Research, Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, MA, 02139"],"affiliations":[{"raw_affiliation_string":"Boeing Professor of Operations Research, Sloan School of Management and Operations Research Center, Massachusetts Institute of Technology, E53-363, Cambridge, MA, 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086975125","display_name":"Melvyn Sim","orcid":"https://orcid.org/0000-0001-9798-2482"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Melvyn Sim","raw_affiliation_strings":["Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 02139"],"affiliations":[{"raw_affiliation_string":"Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025940525"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":25.2117,"has_fulltext":false,"cited_by_count":1774,"citation_normalized_percentile":{"value":0.99778372,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"98","issue":"1-3","first_page":"49","last_page":"71"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7299153208732605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5891430974006653},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5498183965682983},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.5271310806274414},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5201333165168762},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49522367119789124},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.4911167323589325},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45464926958084106},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4491071105003357},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4397313892841339},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22976097464561462}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7299153208732605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5891430974006653},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5498183965682983},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5271310806274414},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5201333165168762},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49522367119789124},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.4911167323589325},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45464926958084106},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4491071105003357},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4397313892841339},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22976097464561462},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-003-0396-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0396-4","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:CiteSeerX.psu:10.1.1.115.1682","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bschool.nus.edu/staff/dscsimm/docs/rodiscrete.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.7447","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.7447","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/Robust%20Optimization/Robust%20Discrete%20optimization%20and%20Network%20Flows.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.392.4470","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.4470","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/melvyn/Robust-Discrete-Optimization-And-Network-Flows-MP98.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W134281200","https://openalex.org/W1480364293","https://openalex.org/W1963888335","https://openalex.org/W1968143987","https://openalex.org/W1972348150","https://openalex.org/W1977545325","https://openalex.org/W2003777645","https://openalex.org/W2048679451","https://openalex.org/W2080208950","https://openalex.org/W2084575717","https://openalex.org/W2089105401","https://openalex.org/W2097596248","https://openalex.org/W2118578357","https://openalex.org/W2127331687","https://openalex.org/W2143863355","https://openalex.org/W2169528473","https://openalex.org/W2266816739"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4307077390","https://openalex.org/W4226239598","https://openalex.org/W2482469685"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":22},{"year":2025,"cited_by_count":67},{"year":2024,"cited_by_count":79},{"year":2023,"cited_by_count":100},{"year":2022,"cited_by_count":111},{"year":2021,"cited_by_count":112},{"year":2020,"cited_by_count":103},{"year":2019,"cited_by_count":111},{"year":2018,"cited_by_count":129},{"year":2017,"cited_by_count":110},{"year":2016,"cited_by_count":106},{"year":2015,"cited_by_count":118},{"year":2014,"cited_by_count":103},{"year":2013,"cited_by_count":97},{"year":2012,"cited_by_count":74}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}