{"id":"https://openalex.org/W1987724552","doi":"https://doi.org/10.1007/s10589-005-3076-x","title":"Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm","display_name":"Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm","publication_year":2005,"publication_date":"2005-10-18","ids":{"openalex":"https://openalex.org/W1987724552","doi":"https://doi.org/10.1007/s10589-005-3076-x","mag":"1987724552"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-005-3076-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-005-3076-x","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5044134058","display_name":"Claus Still","orcid":null},"institutions":[{"id":"https://openalex.org/I130217899","display_name":"\u00c5bo Akademi University","ror":"https://ror.org/029pk6x14","country_code":"FI","type":"education","lineage":["https://openalex.org/I130217899"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Claus Still","raw_affiliation_strings":["Department of Mathematics, \u00c5bo Akademi University, F\u00e4nriksgatan 3B, FIN-20500, \u00c5bo, Finland","Department of Mathematics, \u00c5bo Akademi University, \u00c5bo, Finland FIN-20500#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, \u00c5bo Akademi University, F\u00e4nriksgatan 3B, FIN-20500, \u00c5bo, Finland","institution_ids":["https://openalex.org/I130217899"]},{"raw_affiliation_string":"Department of Mathematics, \u00c5bo Akademi University, \u00c5bo, Finland FIN-20500#TAB#","institution_ids":["https://openalex.org/I130217899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037388244","display_name":"Tapio Westerlund","orcid":"https://orcid.org/0000-0002-8979-9642"},"institutions":[{"id":"https://openalex.org/I130217899","display_name":"\u00c5bo Akademi University","ror":"https://ror.org/029pk6x14","country_code":"FI","type":"education","lineage":["https://openalex.org/I130217899"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tapio Westerlund","raw_affiliation_strings":["Process Design Laboratory, \u00c5bo Akademi University, Biskopsgatan 8, FIN-20500, \u00c5bo, Finland","Process Design Laboratory, \u00c5bo Akademi University, \u00c5bo, Finland FIN-20500#TAB#"],"affiliations":[{"raw_affiliation_string":"Process Design Laboratory, \u00c5bo Akademi University, Biskopsgatan 8, FIN-20500, \u00c5bo, Finland","institution_ids":["https://openalex.org/I130217899"]},{"raw_affiliation_string":"Process Design Laboratory, \u00c5bo Akademi University, \u00c5bo, Finland FIN-20500#TAB#","institution_ids":["https://openalex.org/I130217899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044134058"],"corresponding_institution_ids":["https://openalex.org/I130217899"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.7226,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.83387978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"1","first_page":"63","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9952999949455261,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/cutting-plane-method","display_name":"Cutting-plane method","score":0.7871145009994507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6877637505531311},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6468641757965088},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6172598600387573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6170403957366943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5782502889633179},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5482771992683411},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.47469133138656616},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.43951475620269775},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43842169642448425},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4291265606880188},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42861688137054443},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.41465187072753906},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.41069743037223816},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37290388345718384},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.17151278257369995}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7871145009994507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6877637505531311},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6468641757965088},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6172598600387573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6170403957366943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5782502889633179},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5482771992683411},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.47469133138656616},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43951475620269775},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43842169642448425},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4291265606880188},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42861688137054443},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41465187072753906},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.41069743037223816},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37290388345718384},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.17151278257369995},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10589-005-3076-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-005-3076-x","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W54096403","https://openalex.org/W94888552","https://openalex.org/W1482298744","https://openalex.org/W1541170979","https://openalex.org/W1579101628","https://openalex.org/W1594264634","https://openalex.org/W1970424338","https://openalex.org/W1970686413","https://openalex.org/W1987924891","https://openalex.org/W1997215277","https://openalex.org/W1999049191","https://openalex.org/W2007231110","https://openalex.org/W2016771881","https://openalex.org/W2021674665","https://openalex.org/W2033735555","https://openalex.org/W2048553760","https://openalex.org/W2048670190","https://openalex.org/W2048799772","https://openalex.org/W2066875914","https://openalex.org/W2071334094","https://openalex.org/W2085351511","https://openalex.org/W2088985283","https://openalex.org/W2089874838","https://openalex.org/W2091364465","https://openalex.org/W2106106289","https://openalex.org/W2106292145","https://openalex.org/W2127701130","https://openalex.org/W2149454052","https://openalex.org/W2155258508","https://openalex.org/W2156245681","https://openalex.org/W2770781319","https://openalex.org/W3105592538","https://openalex.org/W4240374930","https://openalex.org/W4248948761"],"related_works":["https://openalex.org/W2387389269","https://openalex.org/W2158503982","https://openalex.org/W2568448495","https://openalex.org/W3162501176","https://openalex.org/W2097136890","https://openalex.org/W3104290058","https://openalex.org/W2035726060","https://openalex.org/W2024753861","https://openalex.org/W4303982878","https://openalex.org/W2089185195"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}