Constraint integer programming

By Tobias Achterberg. 2007

629 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Software

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

In Software

Citations in the corpus

Learning to Branch in Mixed Integer Programming (2016, methodology): “Two standard approaches to computing the variable scores are brieﬂy described next; we refer to (Achterberg 2009) for more details.”
Title Generation with Quasi-Synchronous Grammar (2010, background): “Secondly, the model often generates an appropriate title that is lexically distinct from the reference even though it expresses similar meaning.”
Bayesian network learning with cutting planes (2011, methodology): “This decomposition motivates the following preprocessing step: for each variable u and each candidate parent set W for u, compute and store the corresponding local score.”
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning (2016, positive): “Strong branching is another method of variable selection that branches on the variable that induces the most change in the objective function [61,64].”
The SCIP Optimization Suite 3.2 (2016, methodology): “Concerning branching, the customary hybrid branching rule [3] of SCIP is used; node selection is performed with respect to a best estimate criterion—interleaved with best bound and depth-first search phases [1].”
Performance Variability in Mixed-Integer Programming (2013, methodology): “The seventh column, “Time,” displays the shifted geometric mean of the ratios of solution times (see Achterberg [1]), with a shift of s= 1 second.”
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations (2009, methodology): “There are also efficient implementations available, for instance ABACUS [18] and SCIP [1].”
Rounding and Propagation Heuristics for Mixed Integer Programming (2011, methodology): “, 29210-1_12, © Springer-Verlag Berlin Heidelberg 2012 D. Klatte et al. Operations Research Proceedings 2011, Operations Research Proceedings, 72 Tobias Achterberg, Timo Berthold, and Gregor Hendel This article gives an overview about rounding and propagation heuristics for MIP that are integrated i”
SCIP: solving constraint integer programs (2009, methodology): “, tn) = (∏ (ti + s) )1/n − s with shift s ≥ 0, see [2].”
Information-based branching schemes for binary linear mixed integer problems (2009, methodology): “…effort in the integration of approaches from mathematical logic and mathematical programming (see Hooker (1998), Hooker (2000), Dixon and Gins- berg (2000), Achterberg (2007a), Achterberg (2007b), Sandholm and Shields (2006), Avenali (2007), Achterberg (2009) and Achterberg and Berthold (2009)).”
The SCIP Optimization Suite 7.0 (2020, methodology): “For more information on those presolve reductions the reader is referred to Achterberg et al. [5].”
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (2021, methodology): “The means were computed with a shift of 1 second (see Achterberg [1]).”
Automatic Generation of Story Highlights (2010, methodology): “To solve the ILP model we used the ZIB Optimization Suite software (Achterberg, 2007; Koch, 2004; Wunderling, 1996).”
Joint Placement of Phasor and Power Flow Measurements for Observability of Power Systems (2011, methodology): “The programs were implemented with SCIP (Solving Constraint Integer Programs) [21], a noncommercial mixed integer program-”
Mixed Integer Linear Programming Formulation Techniques (2015, background): “f(x) =  x+ 2 x ∈ [0, 1] −2x+ 5 x ∈ [1, 2] 1 x ∈ [2, 3] , (2.”
Railway Track Allocation: Models and Algorithms (2012, methodology): “The first train should start in the time interval [1, 4] and arrive in the window [3, 6], while the second train should depart in [1, 3] and arrive in [5, 7].”
Branching on nonchimerical fractionalities (2012, background): “This is particularly encouraging if one considers the proof-of-concept nature of our implementation.”
Primal Heuristics for Mixed Integer Programs (2006, background): “An exact definition and a discussion of CIPs is given in [2].”
Progress in presolving for mixed integer programming (2015, methodology): “The basic version performs all the presolving steps implemented in SCIP (for more details, we refer to [2]), but disables the techniques newly introduced in this paper, which are included in the advanced presolving.”