{"id":"https://openalex.org/W1482477636","doi":"https://doi.org/10.1007/978-3-540-48085-3_19","title":"A Framework for Constraint Programming Based Column Generation","display_name":"A Framework for Constraint Programming Based Column Generation","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1482477636","doi":"https://doi.org/10.1007/978-3-540-48085-3_19","mag":"1482477636"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-48085-3_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-48085-3_19","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":"book-chapter","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/A5033979458","display_name":"Ulrich Junker","orcid":"https://orcid.org/0000-0002-5007-1582"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ulrich Junker","raw_affiliation_strings":["ILOG S.A., 1681, route des Dolines, F-06560, Valbonne, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ILOG S.A., 1681, route des Dolines, F-06560, Valbonne, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007364689","display_name":"Stefan E. Karisch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefan E. Karisch","raw_affiliation_strings":["Carmen Systems AB, Odinsgatan 9, S-41103, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carmen Systems AB, Odinsgatan 9, S-41103, Gothenburg, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074188080","display_name":"Niklas Kohl","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niklas Kohl","raw_affiliation_strings":["Carmen Systems AB, Odinsgatan 9, S-41103, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carmen Systems AB, Odinsgatan 9, S-41103, Gothenburg, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020159111","display_name":"Bo Vaaben","orcid":"https://orcid.org/0000-0002-4633-1097"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Bo Vaaben","raw_affiliation_strings":["Department of Mathematical Modelling, Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Modelling, Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045377224","display_name":"Torsten Fahle","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Torsten Fahle","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045749522","display_name":"Meinolf Sellmann","orcid":"https://orcid.org/0000-0002-4513-8180"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Meinolf Sellmann","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":19.3731,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.99434629,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/column-generation","display_name":"Column generation","score":0.9322684407234192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.771396279335022},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6766810417175293},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6480560302734375},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6145026683807373},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.6034499406814575},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5805150866508484},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5656066536903381},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5404040217399597},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.49292516708374023},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.48172953724861145},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.45869961380958557},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.4423925280570984},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.43970951437950134},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4386630654335022},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.43786951899528503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3455026149749756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2909375727176666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14098688960075378},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12972360849380493},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.11065167188644409},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07729211449623108}],"concepts":[{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.9322684407234192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.771396279335022},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6766810417175293},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6480560302734375},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6145026683807373},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.6034499406814575},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5805150866508484},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5656066536903381},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5404040217399597},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.49292516708374023},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.48172953724861145},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.45869961380958557},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.4423925280570984},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.43970951437950134},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4386630654335022},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.43786951899528503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3455026149749756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2909375727176666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14098688960075378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12972360849380493},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.11065167188644409},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07729211449623108},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-48085-3_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-48085-3_19","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.3175","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3175","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/1999/Junker-1999-FCP.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":13,"referenced_works":["https://openalex.org/W90532612","https://openalex.org/W187359699","https://openalex.org/W194441499","https://openalex.org/W600852043","https://openalex.org/W1580354722","https://openalex.org/W1983743030","https://openalex.org/W2091984336","https://openalex.org/W2112957923","https://openalex.org/W2126386151","https://openalex.org/W2144946856","https://openalex.org/W2149205385","https://openalex.org/W2167580124","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W4303044088","https://openalex.org/W1486916474","https://openalex.org/W2049055139","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2032348095","https://openalex.org/W2495408185","https://openalex.org/W2524435840","https://openalex.org/W2520084020","https://openalex.org/W2156897434"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}