{"id":"https://openalex.org/W1509122287","doi":"https://doi.org/10.1007/bf02238228","title":"A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming","display_name":"A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1509122287","doi":"https://doi.org/10.1007/bf02238228","mag":"1509122287"},"language":"en","primary_location":{"id":"doi:10.1007/bf02238228","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02238228","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","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/A5060672971","display_name":"Gintaras Palubeckis","orcid":"https://orcid.org/0000-0002-4991-1505"},"institutions":[{"id":"https://openalex.org/I172574986","display_name":"Kaunas University of Technology","ror":"https://ror.org/01me6gb93","country_code":"LT","type":"education","lineage":["https://openalex.org/I172574986"]}],"countries":["LT"],"is_corresponding":true,"raw_author_name":"G. Palubeckis","raw_affiliation_strings":["Department of Practical Informatics, Kaunas University of Technology, Studentu St. 50, 3028, Kaunas, Lithuania","Department of Practical Informatics, Kaunas University of Technology, Kaunas, Lithuania"],"affiliations":[{"raw_affiliation_string":"Department of Practical Informatics, Kaunas University of Technology, Studentu St. 50, 3028, Kaunas, Lithuania","institution_ids":["https://openalex.org/I172574986"]},{"raw_affiliation_string":"Department of Practical Informatics, Kaunas University of Technology, Kaunas, Lithuania","institution_ids":["https://openalex.org/I172574986"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5060672971"],"corresponding_institution_ids":["https://openalex.org/I172574986"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.3476,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.85331453,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"54","issue":"4","first_page":"283","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9970999956130981,"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":0.9970999956130981,"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/T10142","display_name":"Formal Methods in Verification","score":0.9950000047683716,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9939000010490417,"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/quadratic-programming","display_name":"Quadratic programming","score":0.6535329818725586},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6202467679977417},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5934873223304749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5550626516342163},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5430558919906616},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.5100663304328918},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4971323311328888},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4778270721435547},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4778020977973938},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4695102870464325},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.46108195185661316},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4466966986656189},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.44602644443511963},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.39089900255203247},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3556223511695862},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12269243597984314}],"concepts":[{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6535329818725586},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6202467679977417},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5934873223304749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5550626516342163},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5430558919906616},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.5100663304328918},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4971323311328888},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4778270721435547},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4778020977973938},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4695102870464325},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.46108195185661316},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4466966986656189},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.44602644443511963},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.39089900255203247},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3556223511695862},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12269243597984314},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02238228","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02238228","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W154818541","https://openalex.org/W1216003154","https://openalex.org/W1501516191","https://openalex.org/W1513772636","https://openalex.org/W1771039473","https://openalex.org/W1971496656","https://openalex.org/W2002507586","https://openalex.org/W2006934540","https://openalex.org/W2009042960","https://openalex.org/W2031978868","https://openalex.org/W2054501360","https://openalex.org/W2055747219","https://openalex.org/W2078992232","https://openalex.org/W2090739911","https://openalex.org/W2118825986"],"related_works":["https://openalex.org/W1983294952","https://openalex.org/W2009796757","https://openalex.org/W1972259521","https://openalex.org/W2941986668","https://openalex.org/W2008600006","https://openalex.org/W2568448495","https://openalex.org/W1997215277","https://openalex.org/W1971357083","https://openalex.org/W2387389269","https://openalex.org/W3112510524"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}