{"id":"https://openalex.org/W1536984458","doi":"https://doi.org/10.1007/11809678_54","title":"On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem","display_name":"On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1536984458","doi":"https://doi.org/10.1007/11809678_54","mag":"1536984458"},"language":"en","primary_location":{"id":"doi:10.1007/11809678_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11809678_54","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5084703610","display_name":"Dae-Sik Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dae-Sik Choi","raw_affiliation_strings":["Department of Industrial Systems and Information Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Systems and Information Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103255105","display_name":"Inchan Choi","orcid":"https://orcid.org/0000-0002-0068-3564"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"In-Chan Choi","raw_affiliation_strings":["Department of Industrial Systems and Information Engineering, Korea University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Systems and Information Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I197347611"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"517","last_page":"526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987999796867371,"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.9987999796867371,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9927999973297119,"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/integer-programming","display_name":"Integer programming","score":0.7514691352844238},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.7457274198532104},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7104419469833374},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6923383474349976},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6173274517059326},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6128460764884949},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5991076827049255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5957066416740417},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.49772289395332336},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.46251240372657776},{"id":"https://openalex.org/keywords/commodity","display_name":"Commodity","score":0.4540960192680359},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4510832726955414},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4384855628013611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3049313426017761},{"id":"https://openalex.org/keywords/finance","display_name":"Finance","score":0.059303879737854004}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7514691352844238},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.7457274198532104},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7104419469833374},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6923383474349976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6173274517059326},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6128460764884949},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5991076827049255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5957066416740417},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.49772289395332336},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.46251240372657776},{"id":"https://openalex.org/C2779439359","wikidata":"https://www.wikidata.org/wiki/Q317088","display_name":"Commodity","level":2,"score":0.4540960192680359},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4510832726955414},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4384855628013611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3049313426017761},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.059303879737854004},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11809678_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11809678_54","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W96571347","https://openalex.org/W1973211560","https://openalex.org/W1987569535","https://openalex.org/W1997272880","https://openalex.org/W2003179633","https://openalex.org/W2019067222","https://openalex.org/W2079465291","https://openalex.org/W2090762828","https://openalex.org/W2095648765","https://openalex.org/W2110177989","https://openalex.org/W2137372562","https://openalex.org/W2266046735"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W2080904092","https://openalex.org/W4231500168","https://openalex.org/W3161514703","https://openalex.org/W2374451529","https://openalex.org/W2151525839","https://openalex.org/W2098682899","https://openalex.org/W2069541586","https://openalex.org/W118936824"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}