Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960): Difference between revisions
From MaRDI portal
Latest revision as of 20:51, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices |
scientific article |
Statements
Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (English)
0 references
23 May 2011
0 references
linear programming
0 references
volumetric center
0 references
analytic center
0 references
interior point methods
0 references
convex programming
0 references
mixed integer programming
0 references
lattice basis reduction
0 references
0 references
0 references
0 references