The DOI matches its Crossref record; 139 of the 139 references it cites were found in a registry or an index.
Mixed-integer nonlinear optimization
Abstract
Many optimal decision problems in scientific, engineering, and public sector applications involve both discrete decisions and nonlinear system dynamics that affect the quality of the final design or plan. These decision problems lead to mixed-integer nonlinear programming (MINLP) problems that combine the combinatorial difficulty of optimizing over discrete variable sets with the challenges of handling nonlinear functions. We review models and applications of MINLP, and survey the state of the art in methods for solving this challenging class of problems. Most solution methods for MINLP apply some form of tree search. We distinguish two broad classes of methods: single-tree and multitree methods. We discuss these two classes of methods first in the case where the underlying problem functions are convex. Classical single-tree methods include nonlinear branch-and-bound and branch-and-cut methods, while classical multitree methods include outer approximation and Benders decomposition. The most efficient class of methods for convex MINLP are hybrid methods that combine the strengths of both classes of classical techniques. Non-convex MINLPs pose additional challenges, because they contain non-convex functions in the objective function or the constraints; hence even when the integer variables are relaxed to be continuous, the feasible region is generally non-convex, resulting in many local minima. We discuss a range of approaches for tackling this challenging class of problems, including piecewise linear approximations, generic strategies for obtaining convex relaxations for non-convex functions, spatial branch-and-bound methods, and a small sample of techniques that exploit particular types of non-convex structures to obtain improved convex relaxations. We finish our survey with a brief discussion of three important aspects of MINLP. First, we review heuristic techniques that can obtain good feasible solution in situations where the search-tree has grown too large or we require real-time solutions. Second, we describe an emerging area of mixed-integer optimal control that adds systems of ordinary differential equations to MINLP. Third, we survey the state of the art in software for MINLP.
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
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Applied Optimal Control: Optimization, Estimation, and Control
Bryson, A. E., & Ho, Y.-C. (2018) · Routledge eBooks · doi:10.1201/9781315137667 · Cited by 6,015
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
J., J. E. (1979) · Technometrics · doi:10.1080/00401706.1979.10489803 · Cited by 3,073
Brook, A., Kendrick, D., & Meeraus, A. (1988) · ACM SIGNUM Newsletter · doi:10.1145/58859.58863 · Cited by 2,973
Theory of Linear and Integer Programming
Smith, D. K. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.94 · Cited by 2,708
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,166
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
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
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
Global Optimization Using Interval Analysis
(2003) · CRC Press eBooks · doi:10.1201/9780203026922 · Cited by 1,674
Törn, A., & Žilinskas, A. (1989) · Cited by 1,673
On Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
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
Integer Programming with a Fixed Number of Variables
Lenstra, H. W. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.4.538 · Cited by 1,440
A Multiple Shooting Algorithm for Direct Solution of Optimal Control Problems *
Bock, H. G., & Plitt, K. J. (1984) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)61205-9 · Cited by 1,306
Model Building in Mathematical Programming
Maher, M. J., & Williams, H. P. (1979) · Journal of the Operational Research Society · doi:10.2307/3009304 · Cited by 1,245
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
Introduction to Global Optimization
Horst, R., Pardalos, P. M., & Thoai, N. V. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-0015-5 · Cited by 1,217
Pyomo: modeling and solving mathematical programs in Python
Hart, W. E., Watson, J.-P., & Woodruff, D. L. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0026-8 · Cited by 1,201
Rubinstein, R. Y., & Kroese, D. P. (2004) · Medical Entomology and Zoology · Cited by 1,074
Knitro: An Integrated Package for Nonlinear Optimization
Byrd, R. H., Nocedal, J., & Waltz, R. A. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1_4 · Cited by 979
Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Oxford University Press eBooks · doi:10.1093/oso/9780195100563.001.0001 · Cited by 975
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
BARON: A general purpose global optimization software package
Sahinidis, N. V. (1996) · Journal of Global Optimization · doi:10.1007/bf00138693 · Cited by 840
Bongartz, I., Conn, A. R., Gould, N. I. M., & Toint, P. L. (1995) · ACM Transactions on Mathematical Software · doi:10.1145/200979.201043 · Cited by 784
2007 American Control Conference
(2007) · 2007 American Control Conference · doi:10.1109/acc.2007.4283169 · Cited by 713
Optimal Transmission Switching
Fisher, E. B., O’Neill, R. P., & Ferris, M. C. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.922256 · Cited by 703
Czyzyk, J., Mesnier, M. P., & More, J. J. (1998) · IEEE Computational Science and Engineering · doi:10.1109/99.714603 · Cited by 648
A tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.3.250 · Cited by 640
Linear and Nonlinear Optimization
Griva, I., Nash, S. G., & Sofer, A. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898717730 · Cited by 628
Edmonds polytopes and a hierarchy of combinatorial problems
Chvátal, V. (1973) · Discrete Mathematics · doi:10.1016/0012-365x(73)90167-2 · Cited by 624
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
Rubinstein, R. Y., & Kroese, D. P. (2004) · Information Science and Statistics · doi:10.1007/978-1-4757-4321-0 · Cited by 597
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
Jointly Constrained Biconvex Programming
Al-Khayyal, F. A., & Falk, J. E. (1983) · Mathematics of Operations Research · doi:10.1287/moor.8.2.273 · Cited by 553
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
Wiley Encyclopedia of Operations Research and Management Science
Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P., & Smith, J. C. (2011) · Wiley eBooks · doi:10.1002/9780470400531 · Cited by 545
Constraint propagation with interval labels
Davis, E. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90091-9 · Cited by 531
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
Deterministic Global Optimization
Floudas, C. A. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-4949-6 · Cited by 493
A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Sherali, H. D., & Adams, W. P. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-4388-3 · Cited by 472
?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
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
On the approximation of curves by line segments using dynamic programming
Bellman, R. (1961) · Communications of the ACM · doi:10.1145/366573.366611 · Cited by 444
Global optimization for the synthesis of integrated water systems in chemical processes
Karuppiah, R., & Grossmann, I. E. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.11.005 · Cited by 437
Computational study of a family of mixed-integer quadratic programming problems
Bienstock, D. (1996) · Mathematical Programming · doi:10.1007/bf02592208 · Cited by 428
Fischetti, M., Glover, F., & Lodi, A. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0570-3 · Cited by 398
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
Sahinidis, N. V., & Tawarmalani, M. (2002) · Cited by 377
A Computational Study of Search Strategies for Mixed Integer Programming
Linderoth, J., & Savelsbergh, M. W. P. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.173 · Cited by 376
Self-citationChoosing What to Protect: Strategic Defensive Allocation against an Unknown Attacker
Bier, V. M., Oliveros, S., & Samuelson, L. (2007) · Journal of Public Economic Theory · doi:10.1111/j.1467-9779.2007.00320.x · Cited by 373
Vielma, J. P., Ahmed, S., & Nemhauser, G. L. (2009) · Operations Research · doi:10.1287/opre.1090.0721 · Cited by 371
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
Defending against Terrorist Attacks with Limited Resources
POWELL, R. (2007) · American Political Science Review · doi:10.1017/s0003055407070244 · Cited by 338
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
Self-citationA 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
Jobst, N. J., Horniman, M. D., Lucas, C. A., & Mitra, G. (2001) · Quantitative Finance · doi:10.1088/1469-7688/1/5/301 · Cited by 239
Presolving in linear programming
Andersen, E. D., & Andersen, K. D. (1995) · Mathematical Programming · doi:10.1007/bf01586000 · Cited by 228
Sandler, T., & M., D. G. A. (2003) · Simulation & Gaming · doi:10.1177/1046878103255492 · Cited by 212
Müller, J., Shoemaker, C. A., & Piché, R. (2013) · Computers & Operations Research · doi:10.1016/j.cor.2012.08.022 · Cited by 197
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
Improving the feasibility pump
Achterberg, T., & Berthold, T. (2006) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.004 · Cited by 181
Pattern Search Algorithms for Mixed Variable Programming
Audet, C., & Dennis, J. E. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623499352024 · Cited by 179
The global solver in the LINDO API
Lin, Y., & Schrage, L. (2009) · Optimization Methods and Software · doi:10.1080/10556780902753221 · Cited by 177
Numerical methods for mixed-integer optimal control problems
Säger, S. (2006) · Cited by 169
MINTO, a mixed INTeger optimizer
Nemhauser, G. L., Savelsbergh, M. W. P., & Sigismondi, G. C. (1994) · Operations Research Letters · doi:10.1016/0167-6377(94)90013-2 · Cited by 161
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
Self-citationOn the Computational Complexity of Integer Programming Problems
Kannan, R., & Monma, C. L. (1978) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-95322-4_17 · Cited by 158
Introduction to Global Optimization.
Tofallis, C., Horst, R., Padalos, P. M., & Thoai, N. V. (1996) · Journal of the Operational Research Society · doi:10.2307/3010143 · Cited by 157
Klepeis, J. L., & Floudas, C. A. (2003) · Biophysical Journal · doi:10.1016/s0006-3495(03)74640-2 · Cited by 156
Bier, V. M. (2007) · Risk Analysis · doi:10.1111/j.1539-6924.2007.00906.x · Cited by 153
The TOMLAB Optimization Environment
Holmström, K., & Edvall, M. M. (2004) · Applied optimization · doi:10.1007/978-1-4613-0215-5_19 · Cited by 145
The integer approximation error in mixed-integer optimal control
Säger, S., Bock, H. G., & Diehl, M. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0405-3 · Cited by 143
Mesh adaptive direct search algorithms for mixed variable optimization
Abramson, M. A., Audet, C., Chrissis, J. W., & Walston, J. G. (2008) · Optimization Letters · doi:10.1007/s11590-008-0089-2 · Cited by 140
A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
Vielma, J. P., Ahmed, S., & Nemhauser, G. L. (2008) · INFORMS journal on computing · doi:10.1287/ijoc.1070.0256 · Cited by 139
A trust region SQP algorithm for mixed-integer nonlinear programming
Exler, O., & Schittkowski, K. (2006) · Optimization Letters · doi:10.1007/s11590-006-0026-1 · Cited by 128
Optimization models for operative planning in drinking water networks
Burgschweiger, J., Gnädig, B., & Steinbach, M. C. (2008) · Optimization and Engineering · doi:10.1007/s11081-008-9040-8 · Cited by 117
Saxena, A., Bonami, P., & Lee, J. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0371-9 · Cited by 117
Conic mixed-integer rounding cuts
Atamtürk, A., & Narayanan, V. (2008) · Mathematical Programming · doi:10.1007/s10107-008-0239-4 · Cited by 114
Cuts for mixed 0-1 conic programming
Cezik, M. T., & Iyengar, G. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0578-3 · Cited by 109
Misener, R., & Floudas, C. A. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0555-6 · Cited by 104
Fischetti, M., & Salvagnin, D. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0007-3 · Cited by 103
Simultaneous mixed-integer dynamic optimization for integrated design and control
Flores‐Tlacuahuac, A., & Biegler, L. T. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.08.010 · Cited by 101
Fowler, K. R., Reese, J. P., Kees, C. E., Dennis, J. E., Kelley, C. T., Miller, C. T., Audet, C., Booker, A. J., Couture, G., Darwin, R. W., et al. (2008) · Advances in Water Resources · doi:10.1016/j.advwatres.2008.01.010 · Cited by 100
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Bao, X., Sahinidis, N. V., & Tawarmalani, M. (2009) · Optimization methods & software · doi:10.1080/10556780902883184 · Cited by 85
Enhancing RLT relaxations via a new class of semidefinite cuts
Sherali, H. D., & Fraticelli, B. M. P. (2002) · Journal of Global Optimization · doi:10.1023/a:1013819515732 · Cited by 83
Hemker, T., Fowler, K. R., Farthing, M. W., & von Stryk, O. (2008) · Optimization and Engineering · doi:10.1007/s11081-008-9048-0 · Cited by 83
The travelling salesman problem with neighbourhoods: MINLP solution
Gentilini, I., Margot, F., & Shimada, K. (2012) · Optimization methods & software · doi:10.1080/10556788.2011.648932 · Cited by 79
Convex Envelopes of Monomials of Odd Degree
Liberti, L., & Pantelides, C. C. (2003) · Journal of Global Optimization · doi:10.1023/a:1021924706467 · Cited by 74
Davis, E., & Ierapetritou, M. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9217-2 · Cited by 68
Sherali, H. D., Subramanian, S., & Loganathan, G. V. (2001) · Journal of Global Optimization · doi:10.1023/a:1008368330827 · Cited by 65
A Global Optimization Approach to a Water Distribution Network Design Problem
Sherali, H. D., & Smith, E. P. (1997) · Journal of Global Optimization · doi:10.1023/a:1008207817095 · Cited by 63
Game-Theoretic and Reliability Methods in Counterterrorism and Security
Bier, V. M. (2007) · Springer eBooks · doi:10.1007/0-387-35209-0_3 · Cited by 61
Rashid, K., Ambani, S., & Çetinkaya, E. (2012) · Engineering Optimization · doi:10.1080/0305215x.2012.665450 · Cited by 52
Abramson, M. A. (2004) · Optimization and Engineering · doi:10.1023/b:opte.0000033373.79886.54 · Cited by 50
Adams, W. P., & Sherali, H. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3966-4 · Cited by 46
A Benchmark Library of Mixed-Integer Optimal Control Problems
Säger, S. (2011) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4614-1927-3_22 · Cited by 42
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
Can search algorithms save large-scale automatic performance tuning?
Balaprakash, P., Wild, S. M., & Hovland, P. (2011) · Procedia Computer Science · doi:10.1016/j.procs.2011.04.234 · Cited by 36
Solving Large MINLPs on Computational Grids
Goux, J.-P., & Leyffer, S. (2002) · Optimization and Engineering · doi:10.1023/a:1021047328089 · Cited by 34
Self-citationRisk optimization with p-order conic constraints: A linear programming approach
Krokhmal, P. A., & Soberanis, P. A. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.03.053 · Cited by 33
Solving mixed integer linear and nonlinear problems using the SCIP Optimization Suite
Berthold, T., Gamrath, G., Gleixner, A., Heinz, S., Koch, T., & Shinano, Y. (2012) · Cited by 28
Phase tracking and restoration of circadian rhythms by model-based optimal control
Shaik, O. S., Säger, S., Slaby, O., & Lebiedz, D. (2008) · IET Systems Biology · doi:10.1049/iet-syb:20070016 · Cited by 27
The Chvátal-Gomory Closure of a Strictly Convex Body
Dadush, D., Dey, S. S., & Vielma, J. P. (2011) · Mathematics of Operations Research · doi:10.1287/moor.1110.0488 · Cited by 24
Derivative Free Surrogate Optimization for Mixed-Integer Nonlinear Black Box Problems in Engineering
Hemker, T. (2010) · TUbilio (Technical University of Darmstadt) · Cited by 21
Zhu, Y., & Kuno, T. (2005) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0402719 · Cited by 18
Global Optimization in the COCONUT Project
Schichl, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24738-8_14 · Cited by 16
On the Chvátal-Gomory Closure of a Compact Convex Set
Dadush, D., Dey, S. S., & Vielma, J. P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20807-2_11 · Cited by 15
Optimal design of engineering structures
Muc, A. (2017) · International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) · doi:10.1109/fskd.2017.8393334 · Cited by 15
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
Cited by
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
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
Energy management system for smart grid: An overview and key issues
Rathor, S. K., & Saxena, D. (2020) · International Journal of Energy Research · doi:10.1002/er.4883 · Cited by 494
Benchmark and Survey of Automated Machine Learning Frameworks
Zöller, M.-A., & Huber, M. F. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.11854 · Cited by 448
Perception Task Offloading With Collaborative Computation for Autonomous Driving
Xiao, Z., Shu, J., Jiang, H., Min, G., Chen, H., & Han, Z. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3227027 · Cited by 394
Metadata
- Authors
- Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A.
- Venue
- Acta Numerica
- Publisher
- Cambridge University Press (CUP)
- Published
- 2013-04-02
- Volume
- 22
- Pages
- 1-131
- ISSN
- 0962-4929 (ISSN-L)
- 1474-0508
- OpenAlex
- W2133304166
- Cited by
- 712
- References
- 139
- FWCI
- 39.01
- 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.