SCIP: solving constraint integer programs
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Combinatorial optimization (90C27)
Recommendations
- scientific article; zbMATH DE number 1947383
- scientific article; zbMATH DE number 7124428
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Constraint and integer programming in OPL
- Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
- scientific article; zbMATH DE number 14318
- Integer programs for logic constraint satisfaction
- Constraint and integer programming. Toward a unified methodology.
- Computational integer programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
Cites work
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A Computational Study of Search Strategies for Mixed Integer Programming
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Algorithms for hybrid MILP/CP models for a class of optimization problems
- Benchmarking optimization software with performance profiles.
- Binary Decision Diagrams
- Branch and Bound Methods for Mathematical Programming Systems
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
- Branch-and-Cut for the Maximum Feasible Subsystem Problem
- Branching rules revisited
- Computer Aided Verification
- Computer Codes for Problems of Integer Programming
- Computing Optimal Morse Matchings
- Conflict analysis in mixed integer programming
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
- Experiments in mixed-integer linear programming
- Experiments in mixed-integer linear programming using pseudo-costs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Flow pack facets of the single node fixed-charge flow polytope
- Gomory cuts revisited
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 3156817 (Why is no real title available?)
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1947383 (Why is no real title available?)
- scientific article; zbMATH DE number 1798189 (Why is no real title available?)
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Improving the feasibility pump
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Introduction to ABACUS -- a branch-and-cut system
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
- Local branching
- MIPLIB 2003
- Noncommercial software for mixed-integer linear programming
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- On the facets of the mixed-integer knapsack polyhedron
- On the Graph Bisection Cut Polytope
- On the Solution of Discrete Programming Problems
- Orbitopal Fixing
- Planning and Scheduling by Logic-Based Benders Decomposition
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- SCIP: solving constraint integer programs
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving planning and scheduling problems with combined integer and constraint programming
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- The traveling salesman problem. A computational study.
- Theory and Applications of Satisfiability Testing
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Valid inequalities for mixed 0-1 programs
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(only showing first 100 items - show all)- SCIP
- Constraint programming and operations research
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- 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
- 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
- Solving MIPs via scaling-based augmentation
- A customized branch-and-bound approach for irregular shape nesting
- Robust tube-based MPC of constrained piecewise affine systems with bounded additive disturbances
- 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
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
- 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
- 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
- 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
- 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
- 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
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- A relax-and-cut framework for Gomory mixed-integer cuts
- Strategic uncertainty in markets for nonrenewable resources: a level-k approach
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- On the use of intersection cuts for bilevel optimization
- Polyhedral approximation in mixed-integer convex optimization
- Could we use a million cores to solve an integer program?
- 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
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Optimization algorithms for resilient path selection in networks
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- 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
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- The rankability of weighted data from pairwise comparisons
- 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
- Siting renewable power generation assets with combinatorial optimisation
- Optimal patchings for consecutive ones matrices
- Inversion of convection-diffusion equation with discrete sources
- A branch-and-price algorithm for the ring-tree facility location problem
- Adaptive large neighborhood search for mixed integer programming
- Discrete dynamical system approaches for Boolean polynomial optimization
- 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
- Outer approximation with conic certificates for mixed-integer convex problems
- Benchmarking optimization software -- a (Hi)story
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- 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
- 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
- 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
- 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
- Random sampling and machine learning to understand good decompositions
- A lexicographic pricer for the fractional bin packing problem
- 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
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Exact computation of censored least absolute deviations estimator
- A combinatorial branch-and-bound algorithm for box search
Describes a project that uses
Uses Software
This page was built for publication: SCIP: solving constraint integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734351)
