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