Pages that link to "Item:Q4202587"

The following pages link to An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming (Q4202587):

Displaying 13 items.

• Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← 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)
• Thinner is not always better: cascade knapsack problems (Q1727953) (← links)
• Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
• Could we use a million cores to solve an integer program? (Q1935943) (← links)
• Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
• Lattice Reformulation Cuts (Q5162650) (← links)
• On the Structure of Reduced Kernel Lattice Bases (Q5244870) (← links)
• A framework for constructing general integer problems with well-determined duality gaps (Q5955093) (← links)
• A study of lattice reformulations for integer programming (Q6047692) (← links)