{"id":"https://openalex.org/W1493154510","doi":"https://doi.org/10.1007/3-540-45578-7_1","title":"Hybrid Benders Decomposition Algorithms in Constraint Logic Programming","display_name":"Hybrid Benders Decomposition Algorithms in Constraint Logic Programming","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1493154510","doi":"https://doi.org/10.1007/3-540-45578-7_1","mag":"1493154510"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45578-7_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45578-7_1","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/A5089660083","display_name":"Andrew Eremin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew Eremin","raw_affiliation_strings":["IC-Parc, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IC-Parc, London, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013174025","display_name":"Mark Wallace","orcid":"https://orcid.org/0000-0001-7326-8110"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Wallace","raw_affiliation_strings":["IC-Parc, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IC-Parc, London, UK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0296,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.90414614,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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/T10142","display_name":"Formal Methods in Verification","score":0.9919999837875366,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9678999781608582,"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/benders-decomposition","display_name":"Benders' decomposition","score":0.8457558155059814},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.7563315629959106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6828007698059082},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5865859985351562},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5765617489814758},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.547637939453125},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5244758129119873},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.48667770624160767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47073566913604736},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.46907585859298706},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46131443977355957},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44509610533714294},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4144750237464905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2593045234680176},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.17965912818908691},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09976506233215332}],"concepts":[{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.8457558155059814},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.7563315629959106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6828007698059082},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5865859985351562},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5765617489814758},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.547637939453125},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5244758129119873},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.48667770624160767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47073566913604736},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.46907585859298706},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46131443977355957},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44509610533714294},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4144750237464905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2593045234680176},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.17965912818908691},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09976506233215332},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45578-7_1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45578-7_1","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.8.9769","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.9769","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-icparc.icparc.ic.ac.uk/papers/hybrid_benders_decomposition_algorithms_in_constraint_logic_programming.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":13,"referenced_works":["https://openalex.org/W1482477636","https://openalex.org/W1496031892","https://openalex.org/W1508945008","https://openalex.org/W1542480886","https://openalex.org/W1587190576","https://openalex.org/W1993850412","https://openalex.org/W2009683816","https://openalex.org/W2044121814","https://openalex.org/W2062479662","https://openalex.org/W2127470768","https://openalex.org/W2135638508","https://openalex.org/W4233650534","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2365168741","https://openalex.org/W2020731817","https://openalex.org/W200657494","https://openalex.org/W1596719193","https://openalex.org/W1536334038","https://openalex.org/W2491239989","https://openalex.org/W2118850793","https://openalex.org/W1548860908","https://openalex.org/W2277365967","https://openalex.org/W2138204654"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}