Conflict graphs in solving integer programming problems
From MaRDI portal
Publication:1969889
Recommendations
- A computational study of conflict graphs and aggressive cut separation in integer programming
- Preprocessing and cutting planes with conflict graphs
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- Conflict analysis in mixed integer programming
- Experiments with conflict analysis in mixed integer programming
Cites work
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- MINTO, a Mixed INTeger Optimizer
- On the facial structure of set packing polyhedra
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Reducibility among combinatorial problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
Cited in
(64)- A decomposition approach for the probabilistic maximal covering location-allocation problem
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- The matching relaxation for a class of generalized set partitioning problems
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Theoretical challenges towards cutting-plane selection
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- A computational comparison of symmetry handling methods for mixed integer programs
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph
- General cut-generating procedures for the stable set polytope
- Safe dike heights at minimal costs: an integer programming approach
- Preprocessing and cut generation techniques for multi-objective binary programming
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- The maximum common edge subgraph problem: A polyhedral investigation
- On identifying dominant cliques.
- Experiments with conflict analysis in mixed integer programming
- Preprocessing and cutting planes with conflict graphs
- Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
- Strengthened clique-family inequalities for the stable set polytope
- Worst-case analysis of clique MIPs
- Set covering problem with conflict constraints
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem
- Transferring information across restarts in MIP
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- Hypergraph conflict analysis
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
- Conflict analysis in mixed integer programming
- A LP-based heuristic for a time-constrained routing problem
- Integer programming methods for solving binary interdiction games
- Integer programming techniques for the nurse rostering problem
- A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
- Solving a multigroup mixed-integer programming-based constrained discrimination model
- A computational study of conflict graphs and aggressive cut separation in integer programming
- Presolve Reductions in Mixed Integer Programming
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
- Automated knowledge source selection and service composition
- Optimal network design with end-to-end service requirements
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Integer constraints for enhancing interpretability in linear regression
- Conflict Analysis for MINLP
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
- Exact Solution Algorithms for the Chordless Cycle Problem
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
- Strong formulation for the spot 5 daily photograph scheduling problem
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Detecting constraint redundancy in 0-1 linear programming problems
- Relaxations and cutting planes for linear programs with complementarity constraints
- Generalized coefficient strengthening cuts for mixed integer programming
- Solving continuous and discrete nonlinear programs with BARON
- A combined linear and nonlinear presolve for nonlinear optimization
- Presolving and cutting planes for the generalized maximal covering location problem
- Cutting planes in integer and mixed integer programming
- Stable set reformulations for the degree preserving spanning tree problem
- Incorporating bounds from decision diagrams into integer programming
- Progress in presolving for mixed integer programming
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
This page was built for publication: Conflict graphs in solving integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969889)
