Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 90C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C25
@@ Property / Mathematics Subject Classification ID: 90C25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5898965
@@ Property / zbMATH DE Number: 5898965 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear programming
@@ Property / zbMATH Keywords: linear programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+volumetric center
@@ Property / zbMATH Keywords: volumetric center / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+analytic center
@@ Property / zbMATH Keywords: analytic center / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+interior point methods
@@ Property / zbMATH Keywords: interior point methods / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+convex programming
@@ Property / zbMATH Keywords: convex programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed integer programming
@@ Property / zbMATH Keywords: mixed integer programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lattice basis reduction
@@ Property / zbMATH Keywords: lattice basis reduction / rank @@
+Normal rank

Revision as of 09:30, 1 July 2023