Pages that link to "Item:Q537960"
From MaRDI portal
The following pages link to Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960):
Displaying 8 items.
- On the volumetric path (Q691484) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management (Q2797463) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
- A study of lattice reformulations for integer programming (Q6047692) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)