Pages that link to "Item:Q4022031"

The following pages link to The Generalized Basis Reduction Algorithm (Q4022031):

Displaying 19 items.

• A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
• Branching on general disjunctions (Q543420) (← links)
• Rational orthogonal approximations to orthogonal matrices (Q676580) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Column basis reduction and decomposable knapsack problems (Q834182) (← links)
• A generalization of the integer linear infeasibility problem (Q924629) (← links)
• Optimal routing in double loop networks (Q995561) (← links)
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
• Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
• Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
• Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• Lattice size and generalized basis reduction in dimension three (Q2066314) (← links)
• Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
• A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management (Q2797463) (← links)
• On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
• (Q5741633) (← links)
• A study of lattice reformulations for integer programming (Q6047692) (← links)