{"id":"https://openalex.org/W2015024493","doi":"https://doi.org/10.1007/s10107-003-0469-4","title":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","display_name":"The integration of an interior-point cutting plane method within a branch-and-price algorithm","publication_year":2004,"publication_date":"2004-03-20","ids":{"openalex":"https://openalex.org/W2015024493","doi":"https://doi.org/10.1007/s10107-003-0469-4","mag":"2015024493"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0469-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0469-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/A5044174512","display_name":"Samir Elhedhli","orcid":"https://orcid.org/0000-0003-1922-8286"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Samir Elhedhli","raw_affiliation_strings":["Department of Management Sciences, University of Waterloo, 200 University Ave., W. Waterloo, ON, Ca N2L 3G1","(University of Waterloo)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management Sciences, University of Waterloo, 200 University Ave., W. Waterloo, ON, Ca N2L 3G1","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081792425","display_name":"Jean\u2010Louis Goffin","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jean-Louis Goffin","raw_affiliation_strings":["GERAD/Faculty of Management, McGill university, 1001 Sherbrooke, W. Montreal, Qc, Ca H3A 1G5","McGill University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GERAD/Faculty of Management, McGill university, 1001 Sherbrooke, W. Montreal, Qc, Ca H3A 1G5","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"McGill University","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044174512"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":13.4804,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.98717949,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"100","issue":"2","first_page":"267","last_page":"294"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9993000030517578,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.9234317541122437},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6027073264122009},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6001313924789429},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.5711908936500549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5667197704315186},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5580765008926392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566203594207764},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5494052171707153},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5482296943664551},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5381020307540894},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5159238576889038},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4987196922302246},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.44126996397972107},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43417099118232727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32996541261672974},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.22909817099571228},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14690712094306946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10270056128501892}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.9234317541122437},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6027073264122009},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6001313924789429},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.5711908936500549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5667197704315186},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5580765008926392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566203594207764},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5494052171707153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5482296943664551},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5381020307540894},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5159238576889038},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4987196922302246},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.44126996397972107},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43417099118232727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32996541261672974},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.22909817099571228},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14690712094306946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10270056128501892},{"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0469-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0469-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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W21055737","https://openalex.org/W636124409","https://openalex.org/W1505731132","https://openalex.org/W1509805685","https://openalex.org/W1514645957","https://openalex.org/W1514895294","https://openalex.org/W1570631094","https://openalex.org/W1584376108","https://openalex.org/W1966986674","https://openalex.org/W1968077632","https://openalex.org/W1970834774","https://openalex.org/W1989947834","https://openalex.org/W1991534386","https://openalex.org/W1992439238","https://openalex.org/W1993011104","https://openalex.org/W1993229675","https://openalex.org/W1999475455","https://openalex.org/W2003066927","https://openalex.org/W2005926129","https://openalex.org/W2006884874","https://openalex.org/W2013067314","https://openalex.org/W2013479503","https://openalex.org/W2014944169","https://openalex.org/W2040678783","https://openalex.org/W2054090890","https://openalex.org/W2058653357","https://openalex.org/W2064948689","https://openalex.org/W2066671865","https://openalex.org/W2069512047","https://openalex.org/W2069808690","https://openalex.org/W2070759324","https://openalex.org/W2077410003","https://openalex.org/W2079109527","https://openalex.org/W2085478109","https://openalex.org/W2090939957","https://openalex.org/W2105887395","https://openalex.org/W2139211712","https://openalex.org/W2144946856","https://openalex.org/W2167580124","https://openalex.org/W2611147814","https://openalex.org/W3122364614"],"related_works":["https://openalex.org/W1992439238","https://openalex.org/W2971843904","https://openalex.org/W1974421881","https://openalex.org/W1857841162","https://openalex.org/W2775657508","https://openalex.org/W2073944685","https://openalex.org/W4224243731","https://openalex.org/W2127865202","https://openalex.org/W2019661051","https://openalex.org/W2161798622"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}