{"id":"https://openalex.org/W2000840218","doi":"https://doi.org/10.1287/ijoc.1120.0499","title":"Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm","display_name":"Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm","publication_year":2012,"publication_date":"2012-05-05","ids":{"openalex":"https://openalex.org/W2000840218","doi":"https://doi.org/10.1287/ijoc.1120.0499","mag":"2000840218"},"language":"en","primary_location":{"id":"doi:10.1287/ijoc.1120.0499","doi":"https://doi.org/10.1287/ijoc.1120.0499","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.1120.0499","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","ccf-b","cwts-core","jufo-1","norway-1","poland-100","russia-white-list-2","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5091714809","display_name":"Ruslan Sadykov","orcid":"https://orcid.org/0000-0002-4862-2226","observed_orcids":["https://orcid.org/0000-0002-4862-2226"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ruslan Sadykov","raw_affiliation_strings":["INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France","INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I15057530"]},{"raw_affiliation_string":"INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France#TAB#","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I15057530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011840668","display_name":"Fran\u00e7ois Vanderbeck","orcid":"https://orcid.org/0000-0001-5791-7053","observed_orcids":["https://orcid.org/0000-0001-5791-7053"]},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fran\u00e7ois Vanderbeck","raw_affiliation_strings":["INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France","INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I15057530"]},{"raw_affiliation_string":"INRIA team RealOpt and Mathematics Institute, University of Bordeaux, 33405 Talence, France#TAB#","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.4315,"has_fulltext":false,"cited_by_count":150,"citation_normalized_percentile":{"value":0.97543065,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"25","issue":"2","first_page":"244","last_page":"255"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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/branch-and-price","display_name":"branch-and-price","score":0.9649999737739563},{"id":"https://openalex.org/keywords/conflict-graph","display_name":"conflict graph","score":0.6480000019073486},{"id":"https://openalex.org/keywords/interval-graphs","display_name":"interval graphs","score":0.8510000109672546},{"id":"https://openalex.org/keywords/black-box-solvers","display_name":"black-box solvers","score":0.7179999947547913},{"id":"https://openalex.org/keywords/primal-heuristics","display_name":"primal heuristics","score":0.8659999966621399},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7250000238418579}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7268205881118774},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.611096203327179},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.593224287033081},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5220303535461426},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.45801204442977905},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45750167965888977},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4528660178184509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4440232217311859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4292793571949005},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4162846505641937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4112914502620697},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.38156408071517944},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.33912941813468933},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28091853857040405},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1287/ijoc.1120.0499","doi":"https://doi.org/10.1287/ijoc.1120.0499","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.1120.0499","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","ccf-b","cwts-core","jufo-1","norway-1","poland-100","russia-white-list-2","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"INFORMS Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.6875","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.6875","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.u-bordeaux1.fr/%7Ersadykov/papers/SadykovVanderbeck_BPPC.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00539869v1","doi":null,"is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00539869","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"INFORMS Journal on Computing, 2013, 25 (2), pp.244-255. ⟨10.1287/ijoc.1120.0499⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/115722","doi":null,"is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/115722","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I15057530","host_organization_name":"Universit\u00e9 de Bordeaux","host_organization_lineage":["https://openalex.org/I15057530"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/190073","doi":null,"is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/190073","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I15057530","host_organization_name":"Universit\u00e9 de Bordeaux","host_organization_lineage":["https://openalex.org/I15057530"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W91781137","https://openalex.org/W425108583","https://openalex.org/W1567574749","https://openalex.org/W1601649239","https://openalex.org/W1847958188","https://openalex.org/W1965753814","https://openalex.org/W1999895824","https://openalex.org/W2001472819","https://openalex.org/W2002284890","https://openalex.org/W2005124115","https://openalex.org/W2013067314","https://openalex.org/W2019977411","https://openalex.org/W2026320281","https://openalex.org/W2033394039","https://openalex.org/W2043493954","https://openalex.org/W2048947076","https://openalex.org/W2066671865","https://openalex.org/W2072433682","https://openalex.org/W2084894096","https://openalex.org/W2088776663","https://openalex.org/W2097192020","https://openalex.org/W2117713290","https://openalex.org/W2124475618","https://openalex.org/W2140043891","https://openalex.org/W2999341115","https://openalex.org/W4236127247","https://openalex.org/W4254510866","https://openalex.org/W4300129394"],"related_works":["https://openalex.org/W2124475618","https://openalex.org/W2048947076","https://openalex.org/W3133870113","https://openalex.org/W2002284890","https://openalex.org/W2985659520","https://openalex.org/W2083120958","https://openalex.org/W2734082607","https://openalex.org/W2389755227","https://openalex.org/W3045117486","https://openalex.org/W7063833735"],"abstract_inverted_index":{"The":[0,98],"bin":[1],"packing":[2,8],"problem":[3],"with":[4,124],"conflicts":[5],"consists":[6],"of":[7,14,16,23,36,132,151,157],"items":[9,24,133],"in":[10,27,154],"a":[11,33,37,69,84],"minimum":[12],"number":[13,131],"bins":[15],"limited":[17],"capacity":[18],"while":[19],"avoiding":[20],"joint":[21],"assignments":[22],"that":[25,32,121],"are":[26],"conflict.":[28],"Our":[29,136],"study":[30],"demonstrates":[31],"generic":[34,61],"implementation":[35],"branch-and-price":[38,55],"algorithm":[39,72],"using":[40],"specific":[41],"pricing":[42,74,89],"oracle":[43],"yields":[44],"comparatively":[45],"good":[46],"performance":[47],"for":[48,73,88,144],"this":[49,145],"problem.":[50],"We":[51,67],"use":[52],"our":[53],"black-box":[54],"solver":[56],"BaPCod,":[57],"relying":[58],"on":[59,103],"its":[60],"branching":[62],"scheme":[63],"and":[64,83,129],"primal":[65],"heuristics.":[66],"developed":[68],"dynamic":[70],"programming":[71],"when":[75,90],"the":[76,91,106,109,152],"conflict":[77,92,110,127],"graph":[78,93,111,128],"is":[79,101,112],"an":[80,113,125],"interval":[81,114],"graph,":[82,115],"depth-first-search":[85],"branch-and-bound":[86],"approach":[87],"has":[94],"no":[95],"special":[96],"structure.":[97],"exact":[99],"method":[100],"tested":[102],"instances":[104,120,150],"from":[105],"literature":[107,153],"where":[108],"as":[116,118],"well":[117],"harder":[119],"we":[122],"generated":[123],"arbitrary":[126],"larger":[130],"per":[134],"bin.":[135],"computational":[137],"experiment":[138],"report":[139],"sets":[140],"new":[141],"benchmark":[142],"results":[143],"problem,":[146],"closing":[147],"all":[148],"open":[149],"one":[155],"hour":[156],"CPU":[158],"time.":[159]},"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}