{"id":"https://openalex.org/W2010440802","doi":"https://doi.org/10.1007/s101070050077","title":"A branch-and-cut algorithm for capacitated network design problems","display_name":"A branch-and-cut algorithm for capacitated network design problems","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W2010440802","doi":"https://doi.org/10.1007/s101070050077","mag":"2010440802"},"language":"en","primary_location":{"id":"doi:10.1007/s101070050077","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050077","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/A5034471689","display_name":"Oktay G\u00fcnl\u00fck","orcid":"https://orcid.org/0000-0002-9272-377X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]},{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Oktay G\u00fcnl\u00fck","raw_affiliation_strings":["School of ORIE, Cornell University, Ithaca, New York, e-mail: oktay@orie.cornell.edu. Current Address: NDPA Department, AT&T Labs. Middletown, NJ 07748, e-mail: oktay@att.com., , , , , , US","School of ORIE, Cornell University, Ithaca, New York, e-mail: oktay@orie.cornell.edu. Current Address: NDPA Department, AT&T Labs. Middletown, NJ 07748, e-mail: oktay@att.com., US"],"affiliations":[{"raw_affiliation_string":"School of ORIE, Cornell University, Ithaca, New York, e-mail: oktay@orie.cornell.edu. Current Address: NDPA Department, AT&T Labs. Middletown, NJ 07748, e-mail: oktay@att.com., , , , , , US","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"School of ORIE, Cornell University, Ithaca, New York, e-mail: oktay@orie.cornell.edu. Current Address: NDPA Department, AT&T Labs. Middletown, NJ 07748, e-mail: oktay@att.com., US","institution_ids":["https://openalex.org/I1283103587","https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034471689"],"corresponding_institution_ids":["https://openalex.org/I1283103587","https://openalex.org/I205783295"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":11.9908,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.98839907,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"86","issue":"1","first_page":"17","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9951000213623047,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9911999702453613,"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/rounding","display_name":"Rounding","score":0.7853460311889648},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.7659441828727722},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7407988905906677},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7139922380447388},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6703159809112549},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5840765833854675},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5684219002723694},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5416889190673828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5005793571472168},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46861156821250916},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.4588078260421753},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.45290690660476685},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4419058561325073},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.434567928314209},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4182285964488983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2898631989955902},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15332865715026855}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7853460311889648},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.7659441828727722},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7407988905906677},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7139922380447388},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6703159809112549},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5840765833854675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5684219002723694},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5416889190673828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5005793571472168},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46861156821250916},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.4588078260421753},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.45290690660476685},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4419058561325073},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.434567928314209},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4182285964488983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2898631989955902},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15332865715026855},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s101070050077","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s101070050077","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.52.9606","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.9606","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieor.columbia.edu/~oktay/bc.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1511451563","https://openalex.org/W1968143987","https://openalex.org/W1971809832","https://openalex.org/W1993734840","https://openalex.org/W2018214829","https://openalex.org/W2029242918","https://openalex.org/W2034397200","https://openalex.org/W2042706982","https://openalex.org/W2044758517","https://openalex.org/W2047900282","https://openalex.org/W2051290577","https://openalex.org/W2058858486","https://openalex.org/W2065320942","https://openalex.org/W2070045881","https://openalex.org/W2087132085","https://openalex.org/W2111175290","https://openalex.org/W2145122881","https://openalex.org/W2268446974","https://openalex.org/W2336259629","https://openalex.org/W3123694171"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W2379672298","https://openalex.org/W1531708257","https://openalex.org/W2387389269","https://openalex.org/W2046300504","https://openalex.org/W2263874601","https://openalex.org/W2158503982","https://openalex.org/W4223947110","https://openalex.org/W4313384610","https://openalex.org/W4230854124"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}