SCIP: solving constraint integer programs

DOI10.1007/S12532-008-0001-1zbMath1171.90476OpenAlexW2014328192MaRDI QIDQ734351

Tobias Achterberg

Publication date: 20 October 2009

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-008-0001-1

zbMATH Keywords

integer programmingconstraint programmingSAT

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (only showing first 100 items - show all)

COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS ⋮ Algebraic Perspectives on Signomial Optimization ⋮ On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Extended Formulations in Mixed-Integer Convex Programming ⋮ Normaliz 2013–2016 ⋮ Enumerating Neighborly Polytopes and Oriented Matroids ⋮ Active Set Methods with Reoptimization for Convex Quadratic Integer Programming ⋮ Stabilizing branch‐and‐price for constrained tree problems ⋮ Validation of nominations in gas network optimization: models, methods, and solutions ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ A route generation algorithm for an optimal fuel routing problem between two single ports ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Constraint relaxation for the discrete ordered median problem ⋮ A nearly optimal randomized algorithm for explorable heap selection ⋮ A data driven Dantzig-Wolfe decomposition framework ⋮ New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems ⋮ Cardinality-constrained distributionally robust portfolio optimization ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ Convex Relaxations for Gas Expansion Planning ⋮ Оптимизация загрузки упорядоченной совокупности летательных аппаратов ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ Partial Outer Convexification for Traffic Light Optimization in Road Networks ⋮ Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation ⋮ A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE ⋮ Polyhedral approaches to learning Bayesian networks ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches ⋮ Mathematical Programming Algorithms for Spatial Cloaking ⋮ Toward Computing the Margin of Victory in Single Transferable Vote Elections ⋮ Heuristics of the Branch-Cut-and-Price-Framework SCIP ⋮ More Virtuous Smoothing ⋮ Exploiting Packing Components in General-Purpose Integer Programming Solvers ⋮ From feasibility to improvement to proof: three phases of solving mixed-integer programs ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program ⋮ A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques ⋮ An Exact Rational Mixed-Integer Programming Solver ⋮ Optimization Methods: An Applications-Oriented Primer ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Integrating operations research in constraint programming ⋮ Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey ⋮ Primal Heuristics for Branch-and-Price Algorithms ⋮ A Polyhedral Characterization of Border Bases ⋮ Energy-Efficient Design of a Water Supply System for Skyscrapers by Mixed-Integer Nonlinear Programming ⋮ Cutting to the Chase Solving Linear Integer Arithmetic ⋮ A reformulation-enumeration MINLP algorithm for gas network design ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport ⋮ A combined variable aggregation presolving technique for mixed integer programming ⋮ Enabling research through the SCIP Optimization Suite 8.0 ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ A multi-vendor multi-buyer integrated production-inventory model with greenhouse gas emissions ⋮ Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation ⋮ An optimal algorithm for variable knockout problems ⋮ A multi-agent learning framework for mixed-integer linear programming ⋮ Presolve Reductions in Mixed Integer Programming ⋮ Piecewise Linear Function Fitting via Mixed-Integer Linear Programming ⋮ On the Derivation of Continuous Piecewise Linear Approximating Functions ⋮ PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite ⋮ The Software Portal swMATH: A State of the Art Report and Next Steps ⋮ How to compute the Stanley depth of a module ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space ⋮ Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ Towards an Accurate Solution of Wireless Network Design Problems ⋮ Computing Maximal Copies of Polyhedra Contained in a Polyhedron ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ A heuristic and an exact method for the gate matrix connection cost minimization problem ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs ⋮ A Mixed-Integer PDE-Constrained Optimization Formulation for Electromagnetic Cloaking ⋮ Comments on: ``On learning and branching: a survey ⋮ Constraint programming and operations research ⋮ Searching multiregression dynamic models of resting-state fMRI networks using integer programming ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ Transformation-based preprocessing for mixed-integer quadratic programs ⋮ A polyhedral investigation of star colorings ⋮ Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations ⋮ Mathematical programming techniques in water network optimization ⋮ A branch-cut-and-price algorithm for the piecewise linear transportation problem ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes ⋮ The ring tree facility location problem ⋮ A branch-and-price based heuristic for the stochastic vehicle routing problem with hard time windows ⋮ Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ Grid parallelizing of discrete optimization problems with quasi-block structure matrices ⋮ Theoretical challenges towards cutting-plane selection

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SoPlex
• Zimpl
• MIPLIB
• CPLEX
• Siege
• COIN-OR
• Benchmarks for Optimization Software
• Mosek
• FEASPUMP
• XPRESS
• CLP
• Valse-XT
• Chaff
• MIPLIB2003
• Tabu search
• SIMPL
• Decision tree for optimization software

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SCIP: solving constraint integer programs
• Valid inequalities for mixed 0-1 programs
• Introduction to ABACUS -- a branch-and-cut system
• Local branching
• On the facets of the mixed-integer knapsack polyhedron
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Solving planning and scheduling problems with combined integer and constraint programming
• Branching rules revisited
• MIPLIB 2003
• Conflict analysis in mixed integer programming
• Improving the feasibility pump
• Gomory cuts revisited
• Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
• On the Solution of Discrete Programming Problems
• Planning and Scheduling by Logic-Based Benders Decomposition
• On the Graph Bisection Cut Polytope
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
• Branch-and-Cut for the Maximum Feasible Subsystem Problem
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• Solving Large-Scale Zero-One Linear Programming Problems
• Valid Linear Inequalities for Fixed Charge Problems
• Graph-Based Algorithms for Boolean Function Manipulation
• Computer Codes for Problems of Integer Programming
• Facets of the knapsack polytope
• Experiments in mixed-integer linear programming using pseudo-costs
• Binary Decision Diagrams
• Facets of the Knapsack Polytope From Minimal Covers
• Branch and Bound Methods for Mathematical Programming Systems
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
• A Computational Study of Search Strategies for Mixed Integer Programming
• Computer Aided Verification
• Theory and Applications of Satisfiability Testing
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• Orbitopal Fixing
• Computing Optimal Morse Matchings
• Experiments in mixed-integer linear programming
• Investigation of some branch and bound strategies for the solution of mixed integer linear programs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Flow pack facets of the single node fixed-charge flow polytope
• Benchmarking optimization software with performance profiles.

This page was built for publication: SCIP: solving constraint integer programs