The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
An algorithmic framework for convex mixed integer nonlinear programs
Open accessOverview
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
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
Self-citationBenchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
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
Self-citationA Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
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
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
Self-citationA 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
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
Jünger, M., & Naddef, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45586-8 · Cited by 157
Cited by
All you need to know about model predictive control for buildings
Drgoňa, J., Arroyo, J., Cupeiro Figueroa, I., Blum, D., Arendt, K., Kim, D., Ollé, E. P., Oravec, J., Wetter, M., Vrabie, D. L., et al. (2020) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2020.09.001 · Cited by 1,020
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
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
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
Li, P., Ji, H., Wang, C., Zhao, J., Song, G., Ding, F., & Wu, J. (2017) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2017.2686009 · Cited by 447
Learning Model Predictive Control for Iterative Tasks. A Data-Driven Control Framework
Rosolia, U., & Borrelli, F. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2753460 · Cited by 341
Spatio-Temporal Coordinated V2V Energy Swapping Strategy for Mobile PEVs
Wang, M., Ismail, M., Zhang, R., Shen, X., Serpedin, E., & Qaraqe, K. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2593667 · Cited by 94
Avramidis, I.-I., Capitanescu, F., & Deconinck, G. (2021) · Electric Power Systems Research · doi:10.1016/j.epsr.2020.106864 · Cited by 9
Metadata
- Authors
- 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., & Wächter, A.
- Venue
- Discrete Optimization
- Publisher
- Elsevier BV
- Published
- 2008-05
- Volume
- 5
- Issue
- 2
- Pages
- 186-204
- ISSN
- 1572-5286 (ISSN-L)
- OpenAlex
- W2170213261
- Cited by
- 902
- References
- 13
- FWCI
- 35.86
- Type
- journal article
- Language
- en
- Open access
- bronze
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.