Pages that link to "Item:Q1969889"
From MaRDI portal
The following pages link to Conflict graphs in solving integer programming problems (Q1969889):
Displaying 50 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A computational study of conflict graphs and aggressive cut separation in integer programming (Q324843) (← links)
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- Automated knowledge source selection and service composition (Q453606) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Incorporating bounds from decision diagrams into integer programming (Q823882) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Global optimization of MIQCPs with dynamic piecewise relaxations (Q1668791) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- Safe dike heights at minimal costs: an integer programming approach (Q1754753) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Set covering problem with conflict constraints (Q2147026) (← links)
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (Q2168733) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (Q2333144) (← links)
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints (Q2397760) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Conflict analysis in mixed integer programming (Q2471271) (← links)
- A LP-based heuristic for a time-constrained routing problem (Q2491773) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- Integer constraints for enhancing interpretability in linear regression (Q4969267) (← links)
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
