SCIP: solving constraint integer programs
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
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
- 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?)
- 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 From Minimal Covers
- Facets of the knapsack polytope
- Flow pack facets of the single node fixed-charge flow polytope
- Gomory cuts revisited
- Graph-Based Algorithms for Boolean Function Manipulation
- 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 Graph Bisection Cut Polytope
- On the Solution of Discrete Programming Problems
- On the facets of the mixed-integer knapsack polyhedron
- 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 Linear Inequalities for Fixed Charge Problems
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- Valid inequalities for mixed 0-1 programs
Cited in
(only showing first 100 items - show all)- The Steiner connectivity problem
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- From feasibility to improvement to proof: three phases of solving mixed-integer programs
- The symmetric quadratic traveling salesman problem
- On active-set methods for quadratic problems with positive semidefinite matrices
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Incorporating bounds from decision diagrams into integer programming
- Faster MIP solutions via new node selection rules
- Exploiting symmetries in polyhedral computations
- Discrete level-bundle method for mean-CVaR portfolio optimization with cardinality constraint
- Optimization methods: an applications-oriented primer
- Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
- A framework for solving mixed-integer semidefinite programs
- Minimal counterexamples for linear-time probabilistic verification
- Primal Heuristics for Branch-and-Price Algorithms
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Production-process optimization algorithm: application to fed-batch bioprocess
- A computational study of primal heuristics inside an MI(NL)P solver
- 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 route generation algorithm for an optimal fuel routing problem between two single ports
- A study on the 3D position estimation of ventricular borders extracted from 2D echocardiography data
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Mixed-integer linear programming heuristics for the prepack optimization problem
- Polyhedral approximation in mixed-integer convex optimization
- A mixed-integer PDE-constrained optimization formulation for electromagnetic cloaking
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- QPLIB: a library of quadratic programming instances
- Exploiting symmetries in mathematical programming via orbital independence
- Stabilizing branch-and-price for constrained tree problems
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Progress in presolving for mixed integer programming
- Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Optimal design of periodic frame structures with negative thermal expansion via mixed integer programming
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- A nearly optimal randomized algorithm for explorable heap selection
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Mathematical programming models and exact algorithms
- Validation of nominations in gas network optimization: models, methods, and solutions
- An algorithm-independent measure of progress for linear constraint propagation
- A combined variable aggregation presolving technique for mixed integer programming
- Benchmarking optimization software -- a (Hi)story
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Constraint relaxation for the discrete ordered median problem
- Exact computation of censored least absolute deviations estimator
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- An efficient solution methodology for the airport slot allocation problem with preprocessing and column-and-row generation
- Constraint programming and operations research
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- Computing feasible points for binary MINLPs with MPECs
- Complete mixed integer linear programming formulations for modularity density based clustering
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- A doubly nonnegative relaxation for modularity density maximization
- On the exact separation of cover inequalities of maximum-depth
- On generalized surrogate duality in mixed-integer nonlinear programming
- Comments on: ``On learning and branching: a survey
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Enabling research through the SCIP Optimization Suite 8.0
- More Virtuous Smoothing
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Active set methods with reoptimization for convex quadratic integer programming
- Transformation-based preprocessing for mixed-integer quadratic programs
- A polyhedral investigation of star colorings
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- Further results on an abstract model for branching and its application to mixed integer programming
- Consistency cuts for Dantzig-Wolfe reformulations
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- A lexicographic pricer for the fractional bin packing problem
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Valid inequalities for the topology optimization problem in gas network design
- How much data is sufficient to learn high-performing algorithms?
- Optimal patchings for consecutive ones matrices
- The subdivision of large simplicial cones in Normaliz
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- Inversion of convection-diffusion equation with discrete sources
- Counterexample generation for discrete-time Markov models: an introductory survey
- Comparison of MINLP formulations for global superstructure optimization
- A computational comparison of symmetry handling methods for mixed integer programs
- Binary Steiner trees: structural results and an exact solution approach
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- Random sampling and machine learning to understand good decompositions
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
- Integrated express shipment service network design with customer choice and endogenous delivery time restrictions
- On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
- Metric inequalities for routings on direct connections with application to line planning
- Integrated location-inventory modelling under forward and reverse product flows in the used merchandise retail sector: a multi-echelon formulation
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Hybridizing two linear relaxation techniques in interval-based solvers
- A flag vector of a 3-sphere that is not the flag vector of a 4-polytope
- Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
- Experiments on virtual private network design with concave capacity costs
- A system to evaluate gas network capacities: concepts and implementation
- Local cuts for mixed-integer programming
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Could we use a million cores to solve an integer program?
- Theoretical challenges towards cutting-plane selection
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)
