{"id":"https://openalex.org/W2073457547","doi":"https://doi.org/10.1007/s10107-010-0377-3","title":"Speeding up IP-based algorithms for constrained quadratic 0\u20131 optimization","display_name":"Speeding up IP-based algorithms for constrained quadratic 0\u20131 optimization","publication_year":2010,"publication_date":"2010-05-06","ids":{"openalex":"https://openalex.org/W2073457547","doi":"https://doi.org/10.1007/s10107-010-0377-3","mag":"2073457547"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-010-0377-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0377-3","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/A5066641730","display_name":"Christoph Buchheim","orcid":"https://orcid.org/0000-0001-9974-404X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Buchheim","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Dortmund, Vogelpothsweg 87, 44227, Dortmund, Germany","Technische Universit\u00e4t Dortmund, Fakult\u00e4t f\u00fcr Mathematik, Vogelpothsweg 87, 44227, Dortmund, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Dortmund, Vogelpothsweg 87, 44227, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Technische Universit\u00e4t Dortmund, Fakult\u00e4t f\u00fcr Mathematik, Vogelpothsweg 87, 44227, Dortmund, Germany#TAB#","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006613126","display_name":"Frauke Liers","orcid":"https://orcid.org/0000-0002-1671-0344"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frauke Liers","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00dfe 1, 50969, K\u00f6ln, Germany","Universit\u00e4t zu K\u00f6ln, Institut f\u00fcr Informatik, Pohligstra\u00dfe\u00a01, 50969 K\u00f6ln, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Pohligstra\u00dfe 1, 50969, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":"Universit\u00e4t zu K\u00f6ln, Institut f\u00fcr Informatik, Pohligstra\u00dfe\u00a01, 50969 K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084196031","display_name":"Marcus Oswald","orcid":"https://orcid.org/0000-0002-0740-7343"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marcus Oswald","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","Universit\u00e4t Heidelberg, Institut f\u00fcr Informatik, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Heidelberg, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]},{"raw_affiliation_string":"Universit\u00e4t Heidelberg, Institut f\u00fcr Informatik, Im Neuenheimer Feld 368, 69120, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.5906,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.96049795,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"124","issue":"1-2","first_page":"513","last_page":"535"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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.998199999332428,"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.9962999820709229,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/knapsack-problem","display_name":"Knapsack problem","score":0.7148796319961548},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.645115315914154},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.613239049911499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5963771343231201},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5448224544525146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5304595232009888},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.503494918346405},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.49820852279663086},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28255409002304077}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7148796319961548},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.645115315914154},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.613239049911499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5963771343231201},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5448224544525146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5304595232009888},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.503494918346405},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.49820852279663086},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28255409002304077},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10107-010-0377-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0377-3","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:USBKOELN.ub.uni-koeln.de:54979","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-9974-404X>,","pdf_url":null,"source":{"id":"https://openalex.org/S4306400371","display_name":"K\u00f6lner Universit\u00e4ts PublikationsServer (Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210115942","host_organization_name":"Rhenish Institute for Environmental Research","host_organization_lineage":["https://openalex.org/I4210115942"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:578","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W56346584","https://openalex.org/W1503085769","https://openalex.org/W1541290429","https://openalex.org/W1562417461","https://openalex.org/W1581428370","https://openalex.org/W1586016561","https://openalex.org/W2007500789","https://openalex.org/W2012605254","https://openalex.org/W2034432217","https://openalex.org/W2048804785","https://openalex.org/W2053375152","https://openalex.org/W2066253573","https://openalex.org/W2087999447","https://openalex.org/W2118825986","https://openalex.org/W2128971018","https://openalex.org/W2132400628","https://openalex.org/W2146535985","https://openalex.org/W2148016452","https://openalex.org/W2158907148"],"related_works":["https://openalex.org/W2561020507","https://openalex.org/W2387497027","https://openalex.org/W3137226779","https://openalex.org/W2116348845","https://openalex.org/W2002950710","https://openalex.org/W2489913264","https://openalex.org/W2086980698","https://openalex.org/W2046881509","https://openalex.org/W2073457547","https://openalex.org/W1562417461"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"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"}