Pages that link to "Item:Q2471271"
From MaRDI portal
The following pages link to Conflict analysis in mixed integer programming (Q2471271):
Displaying 50 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Orbitopal fixing (Q408377) (← links)
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Optimized load planning of trains in intermodal transportation (Q443814) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Using dual presolving reductions to reformulate cumulative constraints (Q487651) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Shift-and-propagate (Q524884) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs (Q683326) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- Studying the effective brain connectivity using multiregression dynamic models (Q1705546) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Heuristic solutions to the long-term unit commitment problem with cogeneration plants (Q1761973) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Experiments with conflict analysis in mixed integer programming (Q2011593) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
