Fetching the paper…
Reading the bibliography…
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP.
Linear programming relaxations of quadratically constrained quadratic programs
A. Qualizza, P. Belotti, and F. Margot · 1927
Earlier work this paper cites.
Nonlinear programming
H. W. Kuhn and A. W. Tucker · 1951
Earlier work this paper cites.
The cutting-plane method for solving convex programs
J. E. Kelley · 1960
Earlier work this paper cites.
Concave programming with linear constraints
H. Tuy · 1964
Earlier work this paper cites.
Intersection cuts – a new type of cutting planes for integer programming
E. Balas · 1971
Earlier work this paper cites.
Convexity cuts and cut search
F. Glover · 1973
Earlier work this paper cites.
Polyhedral convexity cuts and negative edge extensions
F. Glover · 1974
Earlier work this paper cites.
Computability of global solutions to factorable nonconvex programs: Part I – convex underestimating problems
G. P. McCormick · 1976
Earlier work this paper cites.
An integer programming approach to scheduling
D. M. Ryan and B. A. Foster · 1981
Earlier work this paper cites.
A tight linearization and an algorithm for zero-one quadratic programming problems
W. P. Adams and H. D. Sherali · 1986
Earlier work this paper cites.
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
M. A. Duran and I. E. Grossmann · 1986
Earlier work this paper cites.
An edge elimination test for the Steiner problem in graphs
C. Duin and A. Volgenant · 1989
Earlier work this paper cites.
Linearization strategies for a class of zero-one mixed integer programming problems
W. P. Adams and H. D. Sherali · 1990
Earlier work this paper cites.
A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
H. D. Sherali and C. H. Tuncbilek · 1992
Earlier work this paper cites.
Mixed-integer bilinear programming problems
W. P. Adams and H. D. Sherali · 1993
Earlier work this paper cites.
Global minimization of indefinite quadratic functions subject to box constraints
P. Hansen, B. Jaumard, M. Ruiz, and J. Xiong · 1993
Earlier work this paper cites.
Initialization of parallel branch-and-bound algorithms
D. Henrich · 1994
Earlier work this paper cites.
Preprocessing and probing techniques for mixed integer programming problems
M. W. P. Savelsbergh · 1994
Earlier work this paper cites.
Finding all solutions of nonlinearly constrained systems of equations
C. D. Maranas and C. A. Floudas · 1995
Earlier work this paper cites.
Paralleler und objektorientierter Simplex-Algorithmus
R. Wunderling · 1996
Earlier work this paper cites.
Decomposing matrices into blocks
R. Borndörfer, C. E. Ferreira, and A. Martin · 1998
Earlier work this paper cites.
Continuous global optimization of structured process systems models
J. M. Zamora and I. E. Grossmann · 1998
Earlier work this paper cites.
A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs
E. Smith and C. Pantelides · 1999
Earlier work this paper cites.
The mixed vertex packing problem
A. Atamtürk, G. L. Nemhauser, and M. W. Savelsbergh · 2000
Earlier work this paper cites.
Mixing mixed-integer inequalities
O. Günlük and Y. Pochet · 2001
Earlier work this paper cites.
Reducibility among combinatorial problems
R. Karp · 2001
Earlier work this paper cites.
Aggregation and mixed integer rounding to solve MIPs
H. Marchand and L. A. Wolsey · 2001
Earlier work this paper cites.
Pruning by isomorphism in branch-and-cut
F. Margot · 2002
Earlier work this paper cites.
Extending Reduction Techniques for the Steiner Tree Problem , pages 795–807
T. Polzin and S. V. Daneshmand · 2002
Earlier work this paper cites.
API Users Manual , 2003
LINDO · 2003
Earlier work this paper cites.
Exploiting orbits in symmetric ILP
F. Margot · 2003
Earlier work this paper cites.
Algorithms for the Steiner problem in networks
T. Polzin · 2003
Earlier work this paper cites.
Branching rules revisited
T. Achterberg, T. Koch, and A. Martin · 2004
Earlier work this paper cites.
Rapid Mathematical Prototyping
T. Koch · 2004
Earlier work this paper cites.
Algorithmic approaches to the Steiner problem in networks
S. Vahdati Daneshmand · 2004
Earlier work this paper cites.
A branch-and-price algorithm for the capacitated p p -median problem
A. Ceselli and G. Righini · 2005
Earlier work this paper cites.
A dominance procedure for integer programming
D. Salvagnin · 2005
Earlier work this paper cites.
A polyhedral branch-and-cut approach to global optimization
M. Tawarmalani and N. V. Sahinidis · 2005
Earlier work this paper cites.
On compact formulations for integer programs solved by column generation
D. Villeneuve, J. Desrosiers, M. Lübbecke, and F. Soumis · 2005
Earlier work this paper cites.
Perspective cuts for a class of convex 0–1 mixed integer programs
A. Frangioni and C. Gentile · 2006
Cited alongside, same era.
Constraint Integer Programming
T. Achterberg · 2007
Cited alongside, same era.
Packing and partitioning orbitopes
V. Kaibel and M. E. Pfetsch · 2008
Cited alongside, same era.
SCIP: Solving Constraint Integer Programs
T. Achterberg · 2009
Cited alongside, same era.
Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs
X. Bao, N. V. Sahinidis, and M. Tawarmalani · 2009
Cited alongside, same era.
Branching and bounds tightening techniques for non-convex MINLP
P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter · 2009
Cited alongside, same era.
SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
S. Vigerske and A. Gleixner · 2017
Later among the works it cites.
A polyhedral study on chance constrained program with random right-hand side
M. Zhao, K. Huang, and B. Zeng · 2017
Later among the works it cites.
Presolve reductions in mixed integer programming
T. Achterberg, R. E. Bixby, Z. Gu, E. Rothberg, and D. Weninger · 2018
Later among the works it cites.
Theoretical challenges towards cutting-plane selection
S. S. Dey and M. Molinaro · 2018
Later among the works it cites.
Selfsplit parallelization for mixed-integer linear programming
M. Fischetti, M. Monaci, and D. Salvagnin · 2018
Later among the works it cites.
The SCIP Optimization Suite 6.0
A. Gleixner, M. Bastubbe, L. Eifler, T. Gally, G. Gamrath, R. L. Gottwald, G. Hendel, C. Hojny, T. Koch, M. E. Lübbecke, S. J. Maher, M. Miltenberger, B. Müller, M. E. Pfetsch, C. Puchert, D. Rehfeldt, F. Schlösser, C. Schubert, F. Serrano, Y. Shinano, J. M. Viernickel, M. Walter, F. Wegscheider, J. T. Witt, and J. Witzig · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Nonlinear pseudo-boolean optimization: relaxation or propagation?
T. Berthold, S. Heinz, and M. E. Pfetsch · 2009
Cited alongside, same era.
A note on convexity of two signomial functions
J.-S. Chen and C.-H. Huang · 2009
Cited alongside, same era.
Constraint propagation on quadratic constraints
F. Domes and A. Neumaier · 2010
Cited alongside, same era.
Experiments with a generic Dantzig-Wolfe decomposition for integer programs
G. Gamrath and M. E. Lübbecke · 2010
Cited alongside, same era.
An integer programming approach for linear programs with probabilistic constraints
J. Luedtke, S. Ahmed, and G. L. Nemhauser · 2010
Cited alongside, same era.
Exploiting second-order cone structure for global optimization
A. Mahajan and T. Munson · 2010
Cited alongside, same era.
Later among the works it cites.
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
D. Juhl, D. M. Warme, P. Winter, and M. Zachariasen · 2018
Later among the works it cites.
Parallel solvers for mixed integer linear optimization
T. Ralphs, Y. Shinano, T. Berthold, and T. Koch · 2018
Later among the works it cites.
Symmetry breaking inequalities from the Schreier-Sims table
D. Salvagnin · 2018
Later among the works it cites.
The Ubiquity Generator framework: 7 years of progress in parallelizing branch-and-bound
Y. Shinano · 2018
Later among the works it cites.
ParaXpress: an experimental extension of the FICO Xpress-Optimizer to solve hard MIPs on supercomputers
Y. Shinano, T. Berthold, and S. Heinz · 2018
Later among the works it cites.
Computational Mixed-Integer Semidefinite Programming
T. Gally · 2019
Later among the works it cites.
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
F. Glover, G. Kochenberger, and Y. Du · 2019
Later among the works it cites.
Polytopes associated with symmetry handling
C. Hojny and M. E. Pfetsch · 2019
Later among the works it cites.
Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
L.-M. Munguía, G. Oxberry, D. Rajan, and Y. Shinano · 2019
Later among the works it cites.
Exploiting symmetry in mixed-integer nonlinear programming
F. Wegscheider · 2019
Later among the works it cites.
Conflict analysis for MINLP
T. Berthold and J. Witzig · 2020
Later among the works it cites.
The SCIP Optimization Suite 7.0
G. Gamrath, D. Anderson, K. Bestuzheva, W.-K. Chen, L. Eifler, M. Gasse, P. Gemander, A. Gleixner, L. Gottwald, K. Halbig, G. Hendel, C. Hojny, T. Koch, P. L. Bodic, S. J. Maher, F. Matter, M. Miltenberger, E. Mühmer, B. Müller, M. E. Pfetsch, F. Schlösser, F. Serrano, Y. Shinano, C. Tawfik, S. Vigerske, F. Wegscheider, D. Weninger, and J. Witzig · 2020
Later among the works it cites.
Packing, partitioning, and covering symresacks
C. Hojny · 2020
Later among the works it cites.
Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
B. Müller, F. Serrano, and A. Gleixner · 2020
Later among the works it cites.
Maximal quadratic-free sets
G. Muñoz and F. Serrano · 2020
Later among the works it cites.
Implications, conflicts, and reductions for Steiner trees
D. Rehfeldt and T. Koch · 2020
Later among the works it cites.
Optimal connected subgraphs: Formulations and algorithms
D. Rehfeldt, H. Franz, and T. Koch · 2020
Later among the works it cites.
A decomposition heuristic for mixed-integer supply chain problems
L. Schewe, M. Schmidt, and D. Weninger · 2020
Later among the works it cites.
On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm
F. Serrano, R. Schwarz, and A. Gleixner · 2020
Later among the works it cites.
Massive parallelization for finding shortest lattice vectors based on Ubiquity Generator Framework
N. Tateiwa, Y. Shinano, S. Nakamura, A. Yoshida, S. Kaji, M. Yasuda, and K. Fujisawa · 2020
Later among the works it cites.
Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
P. Bendotti, P. Fouilhoux, and C. Rottner · 2021
Closest in time.
A computational study of perspective cuts
K. Bestuzheva, A. Gleixner, and S. Vigerske · 2021
Closest in time.
On the implementation and strengthening of intersection cuts for QCQPs
A. Chmiela, G. Muñoz, and F. Serrano · 2021
Closest in time.
Solving challenging large scale QAPs
K. Fujii, N. Ito, S. Kim, M. Kojima, Y. Shinano, and K.-C. Toh · 2021
Closest in time.
Hierarchical strong branching and other strong branching-based branching candidate selection heuristics in branch-and-price
O. Gaul · 2021
Closest in time.
MIPLIB 2017: Data-driven compilation of the 6th Mixed-Integer Programming Library
A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P. Christophel, K. Jarck, T. Koch, J. Linderoth, M. Lübbecke, H. Mittelmann, D. Ozyurt, T. Ralphs, D. Salvagnin, and Y. Shinano · 2021
Closest in time.
MathOptInterface: a data structure for mathematical optimization problems
B. Legat, O. Dowson, J. Garcia, and M. Lubin · 2021
Closest in time.
Solving Steiner trees: Recent advances, challenges, and perspectives
I. Ljubić · 2021
Closest in time.
Presolving for mixed-integer semidefinite optimization
F. Matter and M. E. Pfetsch · 2021
Closest in time.
Papilo: Parallel presolve for integer and linear optimization
papilo · 2021
Closest in time.
On the exact solution of prize-collecting Steiner tree problems
D. Rehfeldt and T. Koch · 2021
Closest in time.
Implications, conflicts, and reductions for steiner trees
D. Rehfeldt and T. Koch · 2021
Closest in time.