SCIP: solving constraint integer programs
type: Item
instance of: scholarly article
title: SCIP: solving constraint integer programs
zbMATH Open document ID: 1171.90476
author: Tobias Achterberg
published in: Mathematical Programming Computation
publication date: 2009-10-20T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90-04
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 5618764
zbMATH Keywords: constraint programming
zbMATH Keywords: integer programming
zbMATH Keywords: SAT
describes a project that uses: MiniSat
describes a project that uses: SoPlex
describes a project that uses: Zimpl
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: SCIL
describes a project that uses: ABACUS
describes a project that uses: CPLEX
describes a project that uses: COIN-OR
describes a project that uses: CLP
describes a project that uses: Tabu search
describes a project that uses: SIMPL
describes a project that uses: Siege
describes a project that uses: FEASPUMP
describes a project that uses: XPRESS
describes a project that uses: MIPLIB2003
describes a project that uses: MIPLIB
describes a project that uses: Mosek
describes a project that uses: Valse-XT
describes a project that uses: Chaff
describes a project that uses: Decision tree for optimization software
MaRDI profile type: Publication
full work available at URL: s12532-008-0001-1
OpenAlex ID: W2014328192
cites work: Conflict analysis in mixed integer programming
cites work: Improving the feasibility pump
cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP
cites work: Branching rules revisited
cites work: MIPLIB 2003
cites work: Binary Decision Diagrams
cites work: Q4411347
cites work: Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
cites work: Q3425132
cites work: A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
cites work: On the Graph Bisection Cut Polytope
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Flow pack facets of the single node fixed-charge flow polytope
cites work: On the facets of the mixed-integer knapsack polyhedron
cites work: On splittable and unsplittable flow capacitated network design arc-set polyhedra.
cites work: Facets of the knapsack polytope
cites work: Gomory cuts revisited
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Branch and Bound Methods for Mathematical Programming Systems
cites work: Experiments in mixed-integer linear programming
cites work: Q4817533
cites work: Q4553262
cites work: Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Q3844775
cites work: Benchmarking optimization software with performance profiles.
cites work: Theory and Applications of Satisfiability Testing
cites work: Local branching
cites work: Computer Aided Verification
cites work: Experiments in mixed-integer linear programming using pseudo-costs
cites work: Q4354785
cites work: Q3274590
cites work: Q5645210
cites work: Planning and Scheduling by Logic-Based Benders Decomposition
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs
cites work: Computing Optimal Morse Matchings
cites work: Orbitopal Fixing
cites work: Computer Codes for Problems of Integer Programming

SCIP: solving constraint integer programs (cites work)
cites work: SCIP: solving constraint integer programs

SCIP: solving constraint integer programs (cites work)
cites work: Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

SCIP: solving constraint integer programs (cites work)
cites work: Q3372341

SCIP: solving constraint integer programs (cites work)
cites work: A Computational Study of Search Strategies for Mixed Integer Programming

SCIP: solving constraint integer programs (cites work)
cites work: Q3429158

SCIP: solving constraint integer programs (cites work)
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs

SCIP: solving constraint integer programs (cites work)
cites work: On the Solution of Discrete Programming Problems

SCIP: solving constraint integer programs (cites work)
cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs

SCIP: solving constraint integer programs (cites work)
cites work: Valid Linear Inequalities for Fixed Charge Problems

SCIP: solving constraint integer programs (cites work)
cites work: Branch-and-Cut for the Maximum Feasible Subsystem Problem

SCIP: solving constraint integer programs (cites work)
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems

SCIP: solving constraint integer programs (cites work)
cites work: Introduction to ABACUS -- a branch-and-cut system

SCIP: solving constraint integer programs (cites work)
cites work: Solving planning and scheduling problems with combined integer and constraint programming

SCIP: solving constraint integer programs (cites work)
cites work: Valid inequalities for mixed 0-1 programs

SCIP: solving constraint integer programs (cites work)
cites work: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints

SCIP: solving constraint integer programs (cites work)
cites work: Q4346087

SCIP: solving constraint integer programs (DOI)
DOI: 10.1007/S12532-008-0001-1

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Q4411347
Similarity Score: 0.91723835
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Q5241193
Similarity Score: 0.903892
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Similarity Score: 0.8894844
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Constraint and integer programming in OPL
Similarity Score: 0.88300604
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm
Similarity Score: 0.87918085
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Q3976891
Similarity Score: 0.8770812
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Integer programs for logic constraint satisfaction
Similarity Score: 0.8743332
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Constraint and integer programming. Toward a unified methodology.
Similarity Score: 0.87226605
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Computational integer programming
Similarity Score: 0.8710991
Recommender Run: Recommender Run 3

SCIP: solving constraint integer programs (Recommended article)
Recommended article: Constraint Integer Programming: A New Approach to Integrate CP and MIP
Similarity Score: 0.87107164
Recommender Run: Recommender Run 3