论文信息 - An example to demonstrate the importance of using ellipsoidal norm in lattice basis reduction for branching on hyperplane algorithms - 字舞流文

An example to demonstrate the importance of using ellipsoidal norm in lattice basis reduction for branching on hyperplane algorithms

Sanjay Mehrotra | Sanjay Mehrotra | Zhifeng Li | Zhifeng Li

[1] Arjen K. Lenstra,et al. Hard Equality Constrained Integer Knapsacks , 2002, Math. Oper. Res..

[2] James Renegar,et al. A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[3] Arjen K. Lenstra,et al. Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables , 2000, Math. Oper. Res..

[4] Arjen K. Lenstra,et al. Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances , 2000, INFORMS J. Comput..

[5] Arjen K. Lenstra,et al. Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables , 1998, IPCO.

[6] László Lovász,et al. The Generalized Basis Reduction Algorithm , 1990, Math. Oper. Res..