Pages that link to "Item:Q3635007"
From MaRDI portal
The following pages link to Aggregation and Mixed Integer Rounding to Solve MIPs (Q3635007):
Displaying 29 items.
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra (Q2390995) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- Manufacturer's mixed pallet design problem (Q2462174) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- Valid inequalities based on the interpolation procedure (Q2490327) (← links)
- UMTS radio network evaluation and optimization beyond snapshots (Q2500787) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- On cut-based inequalities for capacitated network design polyhedra (Q3082603) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
