The DOI matches its Crossref record; 85 of the 85 references it cites were found in a registry or an index.
Non-convex mixed-integer nonlinear programming: A survey
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Duran, M. A., & Grossmann, I. E. (1986) · Mathematical Programming · doi:10.1007/bf02592064 · Cited by 1,447
A polyhedral branch-and-cut approach to global optimization
Tawarmalani, M., & Sahinidis, N. V. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0581-8 · Cited by 1,225
Computers and Chemical Engineering
Biegler, L. T., & Zavala, V. M. (2008) · Cited by 1,200
Simultaneous optimization models for heat integration—II. Heat exchanger network synthesis
Yee, T. F., & Grossmann, I. E. (1990) · Computers & Chemical Engineering · doi:10.1016/0098-1354(90)85010-8 · Cited by 1,074
Deza, M. M., & Laurent, M. (1997) · Algorithms and combinatorics · doi:10.1007/978-3-642-04295-9 · Cited by 1,014
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Sherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
An algorithmic framework for convex mixed integer nonlinear programs
Bonami, P., Biegler, L. T., Conn, A. R., Cornuéjols, G., Grossmann, I. E., Laird, C. D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al. (2008) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.011 · Cited by 902
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
(2009) · Springer eBooks · doi:10.1007/978-0-387-74759-0 · Cited by 815
Handbook of Semidefinite Programming
(2000) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-4381-7 · Cited by 781
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
Tawarmalani, M., & Sahinidis, N. V. (2002) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3532-1 · Cited by 612
Mixed Integer Nonlinear Programming
(2012) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-1-4614-1927-3 · Cited by 607
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91233-6 · Cited by 591
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Tawarmalani, M., & Sahinidis, N. V. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0467-6 · Cited by 569
50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art
(2010) · Springer eBooks · doi:10.1007/978-3-540-68279-0 · Cited by 534
Adjiman, C. S., Dallwig, S., Floudas, C. A., & Neumaier, A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00027-1 · Cited by 526
?BB: A global optimization method for general constrained nonconvex problems
Androulakis, I. P., Maranas, C. D., & Floudas, C. A. (1995) · Journal of Global Optimization · doi:10.1007/bf01099647 · Cited by 465
A review of recent advances in global optimization
Floudas, C. A., & Gounaris, C. E. (2009) · Journal of Global Optimization · doi:10.1007/s10898-008-9332-8 · Cited by 455
An LP/NLP based branch and bound algorithm for convex MINLP optimization problems
Quesada, I., & Grossmann, I. E. (1992) · Computers & Chemical Engineering · doi:10.1016/0098-1354(92)80028-8 · Cited by 455
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Glover, F., & Woolsey, E. (1974) · Operations Research · doi:10.1287/opre.22.1.180 · Cited by 404
Sherali, H. D., & Adams, W. P. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00190-w · Cited by 393
On the copositive representation of binary and continuous nonconvex quadratic programs
Burer, S. (2009) · Mathematical Programming · doi:10.1007/s10107-008-0223-z · Cited by 388
Self-citationA Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Laurent, M. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.470.16391 · Cited by 373
The boolean quadric polytope: Some characteristics, facets and relatives
Padberg, M. W. (1989) · Mathematical Programming · doi:10.1007/bf01589101 · Cited by 356
Adjiman, C. S., Androulakis, I. P., & Floudas, C. A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00218-x · Cited by 349
A branch-and-reduce approach to global optimization
Ryoo, H. S., & Sahinidis, N. V. (1996) · Journal of Global Optimization · doi:10.1007/bf00138689 · Cited by 349
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
Bonami, P., Kılınç, M. R., & Linderoth, J. (2011) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4614-1927-3_1 · Cited by 270
Global optimization of mixed‐integer nonlinear problems
Adjiman, C. S., Androulakis, I. P., & Floudas, C. A. (2000) · AIChE Journal · doi:10.1002/aic.690460908 · Cited by 261
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Adams, W. P., & Sherali, H. D. (1986) · Management Science · doi:10.1287/mnsc.32.10.1274 · Cited by 255
Extended ant colony optimization for non-convex mixed integer nonlinear programming
Schlüter, M., Egea, J. A., & Banga, J. R. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2008.08.015 · Cited by 244
Methods of Nonlinear 0-1 Programming
Hansen, P. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70343-1 · Cited by 220
Copositive Programming – a Survey
Dür, M. (2010) · Springer eBooks · doi:10.1007/978-3-642-12598-0_1 · Cited by 209
An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints
Yiqing, L., Xigang, Y., & Yongjian, L. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.05.016 · Cited by 197
A recipe for semidefinite relaxation for (0,1)-quadratic programming: In memory of Svata Poljak
Poljak, S., Rendl, F., & Wolkowicz, H. (1995) · Journal of Global Optimization · doi:10.1007/bf01100205 · Cited by 196
GloMIQO: Global mixed-integer quadratic optimizer
Misener, R., & Floudas, C. A. (2012) · Journal of Global Optimization · doi:10.1007/s10898-012-9874-7 · Cited by 192
The global solver in the LINDO API
Lin, Y., & Schrage, L. (2009) · Optimization Methods and Software · doi:10.1080/10556780902753221 · Cited by 177
Recent Advances in Optimization and its Applications in Engineering
Diehl, M., Michiels, W., Jarlebring, E., et al. (2010) · Springer eBooks · doi:10.1007/978-3-642-12598-0 · Cited by 174
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Linderoth, J. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0582-7 · Cited by 159
Nonlinear Integer ProgrammingPreprint
Hemmecke, R., Köppe, M., Lee, J., & Weismantel, R. (2009) · Cited by 152
Anjos, M. F., & Vannelli, A. (2008) · INFORMS journal on computing · doi:10.1287/ijoc.1080.0270 · Cited by 136
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs
Fujie, T., & Kojima, M. (1997) · Journal of Global Optimization · doi:10.1023/a:1008282830093 · Cited by 130
Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
Kesavan, P., Allgor, R. J., Gatzke, E. P., & Barton, P. I. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0503-1 · Cited by 125
Billionnet, A., Elloumi, S., & Plateau, M.-C. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.007 · Cited by 121
Saxena, A., Bonami, P., & Lee, J. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0371-9 · Cited by 117
ADVANCES FOR THE POOLING PROBLEM: MODELING, GLOBAL OPTIMIZATION, AND COMPUTATIONAL STUDIES
Misener, R., & Floudas, C. A. (2009) · Cited by 110
Optimal design for sustainable bioethanol supply chain considering detailed plant performance model
Corsano, G., Vecchietti, A., & Montagna, J. M. (2011) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2011.01.008 · Cited by 107
Misener, R., & Floudas, C. A. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0555-6 · Cited by 104
Mixed-integer bilinear programming problems
Adams, W. P., & Sherali, H. D. (1993) · Mathematical Programming · doi:10.1007/bf01581249 · Cited by 98
A Semidefinite Programming Approach to the Quadratic Knapsack Problem
Helmberg, C., Rendl, F., & Weismantel, R. (2000) · Journal of Combinatorial Optimization · doi:10.1023/a:1009898604624 · Cited by 98
GLOBAL OPTIMIZATION METHODSPreprint
Hamm, L., & Brorsen, B. W. (2002) · RePEc: Research Papers in Economics · doi:10.22004/ag.econ.36631 · Cited by 97
Mixed Integer Nonlinear Programming
Floudas, C. A. (2008) · Encyclopedia of Optimization · doi:10.1007/978-0-387-74759-0_394 · Cited by 93
Lee, S.-B., & Grossmann, I. E. (2001) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(01)00732-3 · Cited by 90
Convex envelopes for edge-concave functions
Meyer, C. A., & Floudas, C. A. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0580-9 · Cited by 90
A new linearization technique for multi-quadratic 0–1 programming problems
Chaovalitwongse, W. A., Pardalos, P. M., & Prokopyev, O. A. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.03.005 · Cited by 85
Some remarks on quadratic programming with 0-1 variables
Hammer, P. L., & Rubin, A. A. (1970) · Revue française d informatique et de recherche opérationnelle Série verte · doi:10.1051/ro/197004v300671 · Cited by 83
On the Facial Structure of the Set of Correlation Matrices
Laurent, M., & Poljak, S. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0617031 · Cited by 75
Implementation and Computational Results
Tönshoff, N. (1997) · Deutscher Universitätsverlag eBooks · doi:10.1007/978-3-663-08773-1_12 · Cited by 71
Exler, O., Antelo, L. T., Egea, J. A., Alonso, A. A., & Banga, J. R. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2007.10.008 · Cited by 68
Seizure warning algorithm based on optimization and nonlinear dynamics
Pardalos, P. M., Chaovalitwongse, W. A., Iasemidis, L. D., Sackellares, J. C., Shiau, D., Carney, P. R., Prokopyev, O. A., & Yatsenko, V. A. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0529-4 · Cited by 66
On the Complexity of Nonlinear Mixed-Integer Optimization
Köppe, M. (2011) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4614-1927-3_19 · Cited by 65
Burer, S., & Saxena, A. (2011) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4614-1927-3_13 · Cited by 64
Self-citationAn improved linearization strategy for zero-one quadratic programming problems
Sherali, H. D., & Smith, J. C. (2006) · Optimization Letters · doi:10.1007/s11590-006-0019-0 · Cited by 64
A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem
Sherali, H. D., & Desai, J. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-2706-7 · Cited by 62
Advances in Convex Analysis and Global Optimization
Hadjisavvas, N., & Pardalos, P. M. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0279-7 · Cited by 58
Global quadratic optimization via conic relaxation
Nesterov, Y. E. (1998) · Cited by 55
Karuppiah, R., & Grossmann, I. E. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9203-8 · Cited by 48
Harjunkoski, I., Westerlund, T., & Pörn, R. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00310-5 · Cited by 40
Semidefinite relaxations for non-convex quadratic mixed-integer programming
Buchheim, C., & Wiegele, A. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0534-y · Cited by 40
Information-Guided Genetic Algorithm Approach to the Solution of MINLP Problems
Young, C.-T., Zheng, Y., Yeh, C.-W., & Jang, S. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie060727h · Cited by 37
A cutting plane method for minimizing pseudo-convex functions in the mixed integer case
Pörn, R., & Westerlund, T. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00622-0 · Cited by 32
SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint
Lemaréchal, C., & Oustry, F. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0279-7_6 · Cited by 31
Abhishek, K., Leyffer, S., & Linderoth, J. (2010) · Optimization and Engineering · doi:10.1007/s11081-010-9109-z · Cited by 28
An integer linear programming approach for bilinear integer programming
Freire, A. S., Moreno, E., & Vielma, J. P. (2011) · Operations Research Letters · doi:10.1016/j.orl.2011.12.004 · Cited by 14
Information-guided genetic algorithm approach to the solution of MINLP problems
Young, Zheng, Z., Yeh, Y., & Jang (2007) · 中国生物学文摘 · Cited by 14
Unbounded convex sets for non-convex mixed-integer quadratic programming
Burer, S., & Letchford, A. N. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0609-9 · Cited by 11
Self-citationLagrangian decomposition of block-separable mixed-integer all-quadratic programs
Nowak, I. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0500-9 · Cited by 10
Cited by
Wu, Q., & Zhang, R. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2958916 · Cited by 1,287
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
Misener, R., & Floudas, C. A. (2014) · Journal of Global Optimization · doi:10.1007/s10898-014-0166-2 · Cited by 505
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
Wu, H., Wolter, K., Jiao, P., Deng, Y., Zhao, Y., & Xu, M. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3033521 · Cited by 289
Metadata
- Authors
- Burer, S., & Letchford, A. N.
- Venue
- Surveys in Operations Research and Management Science
- Publisher
- Elsevier BV
- Published
- 2012-07
- Volume
- 17
- Issue
- 2
- Pages
- 97-106
- ISSN
- 1876-7354 (ISSN-L)
- OpenAlex
- W2155014525
- Cited by
- 547
- References
- 85
- FWCI
- 25.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.