An efficient linearization approach for mixed-integer problems (Q1572989): Difference between revisions

@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
+Normal rank
@@ Property / cites work @@
+An Improved MIP Formulation for Products of Discrete and Continuous Variables
+Normal rank
@@ Property / cites work @@
+Equivalent Formulations of Nonlinear Integer Problems for Efficient Optimization
+Normal rank
@@ Property / cites work @@
+An approximate approach of global optimization for polynomial programming problems
+Normal rank
@@ Property / cites work @@
+Solving zero-one mixed integer programming problems using tabu search
+Normal rank
@@ Property / cites work @@
+A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(99)00106-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2050130693
@@ Property / OpenAlex ID: W2050130693 / rank @@
+Normal rank