Conflict analysis in mixed integer programming
From MaRDI portal
Publication:2471271
Recommendations
- Experiments with conflict analysis in mixed integer programming
- Computational aspects of infeasibility analysis in mixed integer programming
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Improving IntSat by expressing disjunctions of bounds as linear constraints
- SCIP: solving constraint integer programs
Cites work
- A Computing Procedure for Quantification Theory
- A finiteness proof for modified dantzig cuts in integer programming
- A machine program for theorem-proving
- BerkMin: A fast and robust SAT-solver
- Conflict graphs in solving integer programming problems
- Design of Logic‐based Intelligent Systems
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- GRASP: a search algorithm for propositional satisfiability
- scientific article; zbMATH DE number 2186837 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- MIPLIB 2003
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Technical Note—Strengthened Dantzig Cuts for Integer Programming
- The complexity of theorem-proving procedures
Cited in
(95)- Feasibility pump 2.0
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Theoretical challenges towards cutting-plane selection
- An abstract model for branching and its application to mixed integer programming
- Domain reduction techniques for global NLP and MINLP optimization
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- Studying the effective brain connectivity using multiregression dynamic models
- A computational comparison of symmetry handling methods for mixed integer programs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants
- How important are branching decisions: fooling MIP solvers
- Conflict graphs in solving integer programming problems
- Experiments with conflict analysis in mixed integer programming
- Preprocessing and cutting planes with conflict graphs
- Computational aspects of infeasibility analysis in mixed integer programming
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- Transferring information across restarts in MIP
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Information-based branching schemes for binary linear mixed integer problems
- Modeling, inference and optimization of regulatory networks based on time series data
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Local rapid learning for integer programs
- A status report on conflict analysis in mixed integer nonlinear programming
- An inexact programming approach for urban electric power systems management under random-interval-parameter uncertainty
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Three ideas for a feasibility pump for nonconvex MINLP
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Mixed integer nonlinear programming tools: an updated practical overview
- Improved branch-cut-and-price for capacitated vehicle routing
- Side-channel cryptographic attacks using pseudo-Boolean optimization
- Comments on: ``On learning and branching: a survey
- Irreducible infeasible subsystems of semidefinite systems
- Dantzig-Wolfe decomposition and branch-and-price solving in G12
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Improving strong branching by domain propagation
- Improving branch-and-cut performance by random sampling
- Achieving consistency with cutting planes
- Mixed integer linear programming formulation techniques
- Parallelization of the FICO Xpress-Optimizer
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
- A first implementation of ParaXpress: combining internal and external parallelization to solve MIPs on supercomputers
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- An exact rational mixed-integer programming solver
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Application of mixed integer quadratic program to shortest vector problems
- A computational study of conflict graphs and aggressive cut separation in integer programming
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- Presolve Reductions in Mixed Integer Programming
- Models and algorithms for packing rectangles into the smallest square
- Mixed integer programming models for job shop scheduling: A computational analysis
- Orbitopal fixing
- Clique-based facets for the precedence constrained knapsack problem
- A space-indexed formulation of packing boxes into a larger box
- Branching on nonchimerical fractionalities
- Optimized load planning of trains in intermodal transportation
- Improving the randomization step in feasibility pump
- Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Measuring the impact of branching rules for mixed-integer programming
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Using dual presolving reductions to reformulate cumulative constraints
- Boosting the feasibility pump
- Conflict Analysis for MINLP
- Conflict-Driven Heuristics for Mixed Integer Programming
- Toward unification of exact and heuristic optimization methods
- Shift-and-propagate
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Constraint programming-based column generation
- Constraint programming-based column generation
- Implications, conflicts, and reductions for Steiner trees
- Online learning for scheduling MIP heuristics
- A supernodal formulation of vertex colouring with applications in course timetabling
- Progress in mathematical programming solvers from 2001 to 2020
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- IntSat: integer linear programming by conflict-driven constraint learning
- Branch-and-cut-and-price for capacitated connected facility location
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Generalized coefficient strengthening cuts for mixed integer programming
- \(\mathcal{V}\)-polyhedral disjunctive cuts
- Learning to use local cuts
- Last fifty years of integer linear programming: a focus on recent practical advances
- SCIP: solving constraint integer programs
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- RENS. The optimal rounding
- Mixed integer nonlinear programming tools: a practical overview
- Incorporating bounds from decision diagrams into integer programming
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- Progress in presolving for mixed integer programming
- Alternating control tree search for knapsack/covering problems
Describes a project that uses
Uses Software
This page was built for publication: Conflict analysis in mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471271)
