The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
The NEOS Server
Open accessAbstract
The Network-Enabled Optimization System (NEOS) is an Internet based optimization service. The NEOS Server introduces a novel approach for solving optimization problems. Users of the NEOS Server submit a problem and their choice of optimization solver over the Internet. The NEOS Server computes all information (for example, derivatives and sparsity patterns) required by the solver, links the optimization problem with the solver, and returns a solution.
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
Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization
Zhu, C., Byrd, R. H., Lu, P., & Nocedal, J. (1997) · ACM Transactions on Mathematical Software · doi:10.1145/279232.279236 · Cited by 3,462
Condor-a hunter of idle workstations
Litzkow, M. J., Livny, M., & Mutka, M. W. (2003) · [1988] Proceedings. The 8th International Conference on Distributed · doi:10.1109/dcs.1988.12507 · Cited by 2,245
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
Griewank, A., Juedes, D. W., & Utke, J. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/229473.229474 · Cited by 746
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1992) · Springer Series in Computational Mathematics · doi:10.1007/978-3-662-12211-2 · Cited by 295
RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
Bertsekas, D. P., Tseng, P., & Systems., D. (1994) · Cited by 107
Cited by
Internet traffic engineering by optimizing OSPF weights
Fortz, B., & Thorup, M. (2002) · Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064) · doi:10.1109/infcom.2000.832225 · Cited by 1,110
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
Bushnell, J. B., Mansur, E. T., & Saravia, C. (2008) · American Economic Review · doi:10.1257/aer.98.1.237 · Cited by 443
Constrained Optimization Approaches to Estimation of Structural Models
(2012) · Econometrica · doi:10.3982/ecta7925 · Cited by 365
Globus Online: Accelerating and Democratizing Science through Cloud-Based Services
Foster, I. (2011) · IEEE Internet Computing · doi:10.1109/mic.2011.64 · Cited by 333
Optimal virtual machine placement across multiple cloud providers
Chaisiri, S., Lee, B.-S., & Niyato, D. (2009) · 2009 IEEE Asia-Pacific Services Computing Conference (APSCC) · doi:10.1109/apscc.2009.5394134 · Cited by 331
Meneco, a Topology-Based Gap-Filling Tool Applicable to Degraded Genome-Wide Metabolic Networks
Prigent, S., Frioux, C., Dittami, S. M., Thiele, S., Larhlimi, A., Collet, G., Gutknecht, F., Got, J., Eveillard, D., Bourdon, J., et al. (2017) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1005276 · Cited by 88
“To solve this optimization problem, solutions to the stoichiometric gap-filling problems for each individual target were computed by running the GAMS encoding from [8] on the NEOS server [42].”
Duality-based verification techniques for 2D SLAM
Carlone, L., & Dellaert, F. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139835 · Cited by 49
Metadata
- Authors
- Czyzyk, J., Mesnier, M. P., & More, J. J.
- Venue
- IEEE Computational Science and Engineering
- Published
- 1998
- Volume
- 5
- Issue
- 3
- Pages
- 68-75
- ISSN
- 1070-9924 (ISSN-L)
- OpenAlex
- W2106292145
- Cited by
- 648
- References
- 6
- FWCI
- 4.74
- Type
- journal article
- Language
- en
- Open access
- green
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.