CoChat
Cited by 207

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

Vigerske, Stefan, Gleixner, Ambros · 2018 · Optimization Methods and Software

Abstract

This paper describes the extensions that were added to the constraint integer programming framework SCIP in order to enable it to solve convex and nonconvex mixed-integer nonlinear programs (MINLPs) to global optimality. SCIP implements a spatial branch-and-bound algorithm based on a linear outer-approximation, which is computed by convex over- and underestimation of nonconvex functions. An expression graph representation of nonlinear constraints allows for bound tightening, structure analysis, and reformulation. Primal heuristics are employed throughout the solving process to find feasible solutions early. We provide insights into the performance impact of individual MINLP solver components via a detailed computational study over a large and heterogeneous test set.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/10556788.2017.1335312

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Individual Comparisons by Ranking Methods

    Wilcoxon, F. (1945) · Biometrics Bulletin · doi:10.2307/3001968 · Cited by 15,354

  • Python for scientific computing

    Oliphant, T. E. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.58 · Cited by 3,303 · cited 1×

    “We use the implementation of the Wilcoxon signed-rank test available in the SciPy package [64,74] with parameters correction=False (default) and zero_method="pratt".”
    Method
  • 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 · cited 14×

    “The most general form of MINLPs handled by SCIP are those where each nonlinear function g j ( x ) can be expressed by the root of an expression tree , where leave nodes correspond to variables and non-leave nodes to algebraic operations on the children given by either a signomial function y (cid:55)→ ∑ kj = 1 α j y ··…”
    BackgroundInfluential

Show all 3 references

Cited by

See all 207

Metadata

Authors
Vigerske, S., & Gleixner, A.
Venue
Optimization Methods and Software
Published
2017-06-14
Volume
33
Issue
3
Pages
563-593
ISSN
  • 1026-7670 (ISSN-L)
  • 1055-6788
  • 1029-4937
OpenAlex
W2411933627
Cited by
207
References
3
FWCI
23.74
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. https://app.cochat.ai/papers/10.1080/10556788.2017.1335312
The paper
Vigerske, S., & Gleixner, A. (2018). SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optimization Methods and Software. https://doi.org/10.1080/10556788.2017.1335312

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.