SCIP: solving constraint integer programs

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

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 programming constraint programming SAT

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

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, 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, On the implementation and strengthening of intersection cuts for QCQPs, Presolve Reductions in Mixed Integer Programming, Piecewise Linear Function Fitting via Mixed-Integer Linear Programming, On the Derivation of Continuous Piecewise Linear Approximating Functions, Mixed Integer Nonlinear Program for Minimization of Akaike’s Information Criterion, 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, Optimal design of periodic frame structures with negative thermal expansion via mixed integer programming, Siting renewable power generation assets with combinatorial optimisation, Generating subtour elimination constraints for the TSP from pure integer solutions, Linear transformation based solution methods for non-convex mixed integer quadratic programs, Three ideas for a feasibility pump for nonconvex MINLP, Optimal patchings for consecutive ones matrices, Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Inversion of convection-diffusion equation with discrete sources, A branch-and-price algorithm for the ring-tree facility location problem, Exact estimation of multiple directed acyclic graphs, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, Adaptive large neighborhood search for mixed integer programming, Cutting plane versus compact formulations for uncertain (integer) linear programs, Local cuts for mixed-integer programming, Discrete dynamical system approaches for Boolean polynomial optimization, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, Sufficient pruning conditions for MINLP in gas network design, Computing convex hulls and counting integer points with \texttt{polymake}, Mathematical programming based heuristics for the 0--1 MIP: a survey, Fairness and the set of optimal rankings for the linear ordering problem, Transferring information across restarts in MIP, Feeder routing for air-to-air refueling operations, Application of data-based solar field models to optimal generation scheduling in concentrating solar power plants, Capping methods for the automatic configuration of optimization algorithms, New formulations for variable cost and size bin packing problems with item fragmentation, Polytopes associated with symmetry handling, Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques, Could we use a million cores to solve an integer program?, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, Outer approximation with conic certificates for mixed-integer convex problems, The symmetric quadratic traveling salesman problem, The Steiner connectivity problem, Coordinated cutting plane generation via multi-objective separation, Combined location and routing problems for drug distribution, On parallelizing dual decomposition in stochastic integer programming, Exploiting symmetry in integer convex optimization using core points, Measuring the impact of primal heuristics, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Undercover: a primal MINLP heuristic exploring a largest sub-MIP, Benchmarking optimization software -- a (Hi)story, Nutmeg: a MIP and CP hybrid solver using branch-and-check, PolySCIP, Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization, Further results on an abstract model for branching and its application to mixed integer programming, Integrated express shipment service network design with customer choice and endogenous delivery time restrictions, ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations, A note on convex reformulation schemes for mixed integer quadratic programs, Automatically improving the anytime behaviour of optimisation algorithms, A primal heuristic for optimizing the topology of gas networks based on dual information, A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs, Learning when to use a decomposition, Valid inequalities for the topology optimization problem in gas network design, Information-based branching schemes for binary linear mixed integer problems, Integer linear programming-based bit-level optimization for high-speed FIR decimation filter architectures, Faster MIP solutions via new node selection rules, Avoiding redundant columns by adding classical Benders cuts to column generation subproblems, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Nearly neighbourly families of standard boxes, Optimization algorithms for resilient path selection in networks, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, QPLIB: a library of quadratic programming instances, Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem, A semi-supervised random vector functional-link network based on the transductive framework, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Improving strong branching by domain propagation, CP methods for scheduling and routing with~time-dependent task costs, Solving wind farm layout optimization with mixed integer programs and constraint programs, Random sampling and machine learning to understand good decompositions, Evaluating the quality of image matrices in blockmodeling, On the use of intersection cuts for bilevel optimization, Polyhedral approximation in mixed-integer convex optimization, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, A lexicographic pricer for the fractional bin packing problem, Mixed Integer Linear Programming Formulation Techniques, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, Mixed-integer optimal control problems with switching costs: a shortest path approach, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, On tackling reverse convex constraints for non-overlapping of unequal circles, Finding all solution sets of piecewise-linear interval equations using an integer programming solver, A doubly nonnegative relaxation for modularity density maximization, On the structure of linear programs with overlapping cardinality constraints, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron, \textsc{OptiMathSAT}: a tool for optimization modulo theories, A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming, LMHS: A SAT-IP Hybrid MaxSAT Solver, The Subdivision of Large Simplicial Cones in Normaliz, The rankability of weighted data from pairwise comparisons, Exact computation of censored least absolute deviations estimator, A combinatorial branch-and-bound algorithm for box search, Cutting to the chase., An algorithm-independent measure of progress for linear constraint propagation, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization, On the exact separation of cover inequalities of maximum-depth, On generalized surrogate duality in mixed-integer nonlinear programming, Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production, 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, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, Scheduling the professional Ecuadorian football league by integer programming, Mathematical programming algorithms for bin packing problems with item fragmentation, Optimal shift partitioning of pharmacies, A novel passenger recovery approach for the integrated airline recovery problem, A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem, Relaxations and heuristics for the multiple non-linear separable knapsack problem, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, A decision-making tool for energy efficiency optimization of street lighting, Optimized load planning for motorail transportation, Mixed integer programming models for job shop scheduling: A computational analysis, Exactly solving packing problems with fragmentation, Solving MIPs via scaling-based augmentation, GLOMIQO: global mixed-integer quadratic optimizer, A customized branch-and-bound approach for irregular shape nesting, Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances, An improved test set approach to nonlinear integer problems with applications to engineering design, Virtuous smoothing for global optimization, Realizability and inscribability for simplicial polytopes via nonlinear optimization, An abstract model for branching and its application to mixed integer programming, A constraint-based local search backend for MiniZinc, A framework for globally optimizing mixed-integer signomial programs, Minimal counterexamples for linear-time probabilistic verification, Convex quadratic relaxations for mixed-integer nonlinear programs in power systems, Orbitopal fixing, Finding all solutions of separable systems of piecewise-linear equations using integer programming, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, Convex reformulations for solving a nonlinear network design problem, Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors, Progress in presolving for mixed integer programming, Domain reduction techniques for global NLP and MINLP optimization, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Graphical models for optimal power flow, A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems, Branching on nonchimerical fractionalities, Practical and efficient algorithms for the geometric hitting set problem, Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, A study on the 3D position estimation of ventricular borders extracted from 2D echocardiography data, Extended formulations for convex envelopes, Using dual presolving reductions to reformulate cumulative constraints, Stanley depth and simplicial spanning trees, The location-dispatching problem: polyhedral results and content delivery network design, RBFOpt: an open-source library for black-box optimization with costly function evaluations, A computational comparison of symmetry handling methods for mixed integer programs, Computing feasible points for binary MINLPs with MPECs, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Integer linear programming for the Bayesian network structure learning problem, Production-process optimization algorithm: application to fed-batch bioprocess, A computational study of primal heuristics inside an MI(NL)P solver, Metric inequalities for routings on direct connections with application to line planning, Binary Steiner trees: structural results and an exact solution approach, Mixed-integer linear programming heuristics for the prepack optimization problem, Complete mixed integer linear programming formulations for modularity density based clustering, Lying generators: manipulability of centralized payoff mechanisms in electrical energy trade, Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation, A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem, Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, Differentiable McCormick relaxations, Three enhancements for optimization-based bound tightening, Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation, Recoverable robust knapsacks: the discrete scenario case, Curriculum based course timetabling: new solutions to Udine benchmark instances, A relax-and-cut framework for Gomory mixed-integer cuts, ZI round, a MIP rounding heuristic, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Strategic uncertainty in markets for nonrenewable resources: a level-\(k\) approach, Experiments on virtual private network design with concave capacity costs, A system to evaluate gas network capacities: concepts and implementation, A decomposition approach for optimal gas network extension with a finite set of demand scenarios, SCIP: solving constraint integer programs, Speeding up column generation for robust wireless network planning, On the safety of Gomory cut generators, A hybrid branch-and-bound approach for exact rational mixed-integer programming, RENS. The optimal rounding, SCIP, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints

Uses Software

Cites Work