The following pages link to (Q3840362):
Displaying 9 items.
- Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Construction of binary and ternary self-orthogonal linear codes (Q1026113) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- Effective lattice point counting in rational convex polytopes (Q2643564) (← links)
- Balanced Integer Solutions of Linear Equations (Q2926145) (← links)
- Solving rank one perturbed linear Diophantine systems by the ABS method (Q3423597) (← links)
