Detecting infeasibility and generating cuts for mixed integer programming using constraint programming (Q2489122): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2005.01.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2003662489
@@ Property / OpenAlex ID: W2003662489 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
+Normal rank
@@ Property / cites work @@
+Q4473038
@@ Property / cites work: Q4473038 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4473026
@@ Property / cites work: Q4473026 / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed global constraints and inference in hybrid CLP--IP solvers
+Normal rank
@@ Property / cites work @@
+Q4254875
@@ Property / cites work: Q4254875 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q4475618
@@ Property / cites work: Q4475618 / rank @@
+Normal rank