{"id":"https://openalex.org/W2185611366","doi":null,"title":"A general solution algorithm for mixed continuous and combinatorial optimization problems","display_name":"A general solution algorithm for mixed continuous and combinatorial optimization problems","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2185611366","mag":"2185611366"},"language":"en","primary_location":{"id":"mag:2185611366","doi":null,"is_oa":false,"landing_page_url":"http://num.math.uni-goettingen.de/preprints/files/2011-20.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5073713999","display_name":"Anita Sch\u00f6bel","orcid":"https://orcid.org/0000-0002-9306-5529","observed_orcids":["https://orcid.org/0000-0002-9306-5529"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anita Sch\u00f6bel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050034758","display_name":"Daniel Scholz","orcid":"https://orcid.org/0000-0002-9310-0101","observed_orcids":["https://orcid.org/0000-0002-9310-0101"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Scholz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9310-0101","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/mixed-integer-nonlinear-programming","display_name":"mixed-integer nonlinear programming","score":0.6830000281333923},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.7680000066757202},{"id":"https://openalex.org/keywords/nonconvex-optimization","display_name":"non-convex optimization","score":0.902999997138977},{"id":"https://openalex.org/keywords/solution-methods","display_name":"solution methods","score":0.5429999828338623}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6014589071273804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5792604684829712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4941249191761017},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.484406054019928},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4785100519657135},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47795915603637695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4712755084037781},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4179916977882385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4148007035255432},{"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":"mag:2185611366","doi":null,"is_oa":false,"landing_page_url":"http://num.math.uni-goettingen.de/preprints/files/2011-20.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W75157487","https://openalex.org/W1964527755","https://openalex.org/W1966306013","https://openalex.org/W1975470165","https://openalex.org/W1986778884","https://openalex.org/W1996950836","https://openalex.org/W2011687300","https://openalex.org/W2019162816","https://openalex.org/W2022071508","https://openalex.org/W2028645072","https://openalex.org/W2034721242","https://openalex.org/W2038511562","https://openalex.org/W2040183473","https://openalex.org/W2061515285","https://openalex.org/W2063102956","https://openalex.org/W2074660787","https://openalex.org/W2075936238","https://openalex.org/W2097245136","https://openalex.org/W2106064552","https://openalex.org/W2133264627","https://openalex.org/W2141286079","https://openalex.org/W2241546590","https://openalex.org/W2301746362","https://openalex.org/W2491360013","https://openalex.org/W3103822957","https://openalex.org/W3150183338"],"related_works":["https://openalex.org/W2028319188","https://openalex.org/W607845112","https://openalex.org/W29244845","https://openalex.org/W1987225287","https://openalex.org/W7099053014","https://openalex.org/W4298131403","https://openalex.org/W2483998465","https://openalex.org/W273872335","https://openalex.org/W7099419103","https://openalex.org/W2056371558"],"abstract_inverted_index":{"Geometric":[0],"branch-and-bound":[1],"techniques":[2],"are":[3],"popular":[4],"solution":[5],"algorithms":[6],"for":[7],"non-convex":[8],"global":[9],"optimization":[10],"problems.":[11],"Although":[12],"several":[13],"quite":[14],"similar":[15],"approaches":[16],"can":[17],"be":[18],"found":[19],"in":[20,25],"the":[21,26],"literature,":[22],"they":[23,28],"dier":[24],"bounds":[27],"use.":[29],"In":[30]},"counts_by_year":[],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}