{"id":"https://openalex.org/W4233636575","doi":"https://doi.org/10.1002/net.3230130407","title":"Dynamic matchings and quasidynamic fractional matchings. I","display_name":"Dynamic matchings and quasidynamic fractional matchings. I","publication_year":1983,"publication_date":"1983-12-01","ids":{"openalex":"https://openalex.org/W4233636575","doi":"https://doi.org/10.1002/net.3230130407"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130407","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"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":"James B. Orlin","raw_affiliation_strings":["Alfred P. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Alfred P. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072685560"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1075,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78932384,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"4","first_page":"551","last_page":"562"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9800999760627747,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9800999760627747,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9692999720573425,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9585999846458435,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7667739391326904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6935625672340393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6786379814147949},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6622100472450256},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6346996426582336},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5448207855224609},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.517326831817627},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5102994441986084},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4917178452014923},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44482359290122986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4297175109386444},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42211562395095825},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.410395085811615},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.227769136428833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1935732364654541}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7667739391326904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6935625672340393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6786379814147949},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6622100472450256},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6346996426582336},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5448207855224609},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.517326831817627},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5102994441986084},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4917178452014923},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44482359290122986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4297175109386444},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42211562395095825},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.410395085811615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.227769136428833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1935732364654541},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230130407","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130407","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.494.6903","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.494.6903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jorlin.scripts.mit.edu/docs/publications/12-dynamic match flows.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":20,"referenced_works":["https://openalex.org/W136000211","https://openalex.org/W1959130699","https://openalex.org/W1978451969","https://openalex.org/W1993778370","https://openalex.org/W2047907098","https://openalex.org/W2051746663","https://openalex.org/W2065295938","https://openalex.org/W2076171427","https://openalex.org/W2079436493","https://openalex.org/W2090168101","https://openalex.org/W2090407060","https://openalex.org/W2113147495","https://openalex.org/W2120921679","https://openalex.org/W2125690626","https://openalex.org/W2126469728","https://openalex.org/W2156849732","https://openalex.org/W2163534333","https://openalex.org/W2327315803","https://openalex.org/W4233756358","https://openalex.org/W6683990620"],"related_works":["https://openalex.org/W2025716666","https://openalex.org/W1963831867","https://openalex.org/W3029871987","https://openalex.org/W2056303072","https://openalex.org/W2167786517","https://openalex.org/W2047424666","https://openalex.org/W2077261354","https://openalex.org/W2903563585","https://openalex.org/W2037935057","https://openalex.org/W2379237265"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"and":[4,48,61,79,128],"solves":[5],"in":[6,20,39,66,75,118,132,142,162,202,205],"polynomial":[7,203],"time":[8,204],"the":[9,133,143,148,163,180,190],"dynamic":[10,144,153,164,183],"matching":[11,154,160,184],"problem,":[12,195],"an":[13,44,49,58,84,99,122],"integer":[14],"programming":[15],"problem":[16,155,185],"which":[17,40,119,196],"involves":[18],"matchings":[19],"a":[21,29,115,159,170],"time\u2010expanded":[22],"infinite":[23,59,181],"network.":[24],"The":[25,136,152],"initial":[26],"model":[27],"is":[28,83,121,147,156,186,197],"finite":[30,191],"directed":[31],"graph":[32,146,165],"G":[33],"=":[34,87,102],"(":[35,88,103],"V,":[36],"E":[37,93,108],")":[38,91,106],"each":[41],"edge":[42,85,100,123,141],"has":[43,169],"associated":[45],"real\u2010valued":[46],"weight":[47,137,149,174],"integral":[50],"distance.":[51],"We":[52,177],"wish":[53],"to":[54,69,72,125,129,157,189,199],"\u201cmatch\u201d":[55],"vertices":[56],"over":[57],"horizon,":[60],"we":[62,113],"permit":[63],"vertex":[64,73,126,130],"i":[65,105],"period":[67,76],"p":[68],"be":[70,200],"matched":[71,140],"j":[74,90],"r":[77],"if":[78,81],"only":[80],"there":[82,120],"e":[86,101],"i,":[89],"of":[92,107,138,150,208],"with":[94,109],"distance":[95,110],"r\u2010p":[96],"or":[97],"else":[98],"j,":[104],"p\u2010r.":[111],"Equivalently,":[112],"construct":[114],"\u201cdynamic":[116],"graph\u201d":[117],"incident":[124],"i\u2010p":[127],"j\u2010r":[131],"above":[134],"cases.":[135],"this":[139,209],"(time\u2010expanded)":[145],"e.":[151],"determine":[158],"M":[161,168],"such":[166],"that":[167,179],"maximum":[171],"long\u2010run":[172],"average":[173],"per":[175],"period.":[176],"show":[178],"horizon":[182,192],"linearly":[187],"transformable":[188],"Q":[193],"\u2010matching":[194],"shown":[198],"solvable":[201],"Part":[206],"II":[207],"paper.":[210]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}