{"id":"https://openalex.org/W167929141","doi":"https://doi.org/10.1007/978-3-319-00293-4_2","title":"Branch and Bound Algorithm Using Cutting Angle Method for Global Minimization of Increasing Positively Homogeneous Functions","display_name":"Branch and Bound Algorithm Using Cutting Angle Method for Global Minimization of Increasing Positively Homogeneous Functions","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W167929141","doi":"https://doi.org/10.1007/978-3-319-00293-4_2","mag":"167929141"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-00293-4_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-00293-4_2","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"},"type":"book-chapter","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/A5110412604","display_name":"Nguy\u1ec5n V\u0103n Tho\u1ea1i","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nguyen Van Thoai","raw_affiliation_strings":["Department of Mathematics, University of Trier, D-54286, Trier, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Trier, D-54286, Trier, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110412604"],"corresponding_institution_ids":["https://openalex.org/I89864525"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11492537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"30"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9955000281333923,"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/cutting-plane-method","display_name":"Cutting-plane method","score":0.7528820037841797},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7239209413528442},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6242252588272095},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6155986785888672},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5583688616752625},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5148586630821228},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.48346787691116333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48253104090690613},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.4504545331001282},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.4294296205043793},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4288903772830963},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4265693128108978},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41440606117248535},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.3856010437011719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2077135145664215},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.12041744589805603},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09079089760780334}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7528820037841797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7239209413528442},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6242252588272095},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6155986785888672},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5583688616752625},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5148586630821228},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.48346787691116333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48253104090690613},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.4504545331001282},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4294296205043793},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4288903772830963},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4265693128108978},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41440606117248535},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.3856010437011719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2077135145664215},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.12041744589805603},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09079089760780334},{"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/978-3-319-00293-4_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-00293-4_2","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W58439901","https://openalex.org/W81972919","https://openalex.org/W206254327","https://openalex.org/W573706636","https://openalex.org/W588748993","https://openalex.org/W1509979919","https://openalex.org/W1523254684","https://openalex.org/W1967182748","https://openalex.org/W1968707428","https://openalex.org/W1989123681","https://openalex.org/W2003229041","https://openalex.org/W2004572490","https://openalex.org/W2010929110","https://openalex.org/W2019908282","https://openalex.org/W2036015269","https://openalex.org/W2069808690","https://openalex.org/W2301746362","https://openalex.org/W2324203538","https://openalex.org/W3158532942"],"related_works":["https://openalex.org/W2087726221","https://openalex.org/W1995757014","https://openalex.org/W2266995929","https://openalex.org/W2390742890","https://openalex.org/W2589063463","https://openalex.org/W2067326682","https://openalex.org/W2811183536","https://openalex.org/W3039239075","https://openalex.org/W2071235713","https://openalex.org/W2025133278"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}