An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Abstract

loading...

About

This paper, published in 1950, received 1.0k indexed citations. Written by Marco A. Durán and Ignacio E. Grossmann covering the research area of Numerical Analysis, Control and Systems Engineering and Computational Theory and Mathematics. It is primarily cited by scholars working on Control and Systems Engineering (543 citations), Numerical Analysis (277 citations) and Computational Theory and Mathematics (214 citations). Published in Mathematical Programming.

Countries where authors are citing An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Since Specialization
Citations

This map shows the geographic impact of An outer-approximation algorithm for a class of mixed-integer nonlinear programs. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by An outer-approximation algorithm for a class of mixed-integer nonlinear programs with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites An outer-approximation algorithm for a class of mixed-integer nonlinear programs more than expected).

Fields of papers citing An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the An outer-approximation algorithm for a class of mixed-integer nonlinear programs.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

This paper is also available at doi.org/10.1007/bf02592064.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026