Faster integer-feasibility in mixed-integer linear programs by branching to force change (Q632648): Difference between revisions

@@ Property / cites work @@
+Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
+Normal rank
@@ Property / cites work @@
+Branching rules revisited
@@ Property / cites work: Branching rules revisited / rank @@
+Normal rank
@@ Property / cites work @@
+MIP models and BB strategies in brachytherapy treatment optimization
+Normal rank
@@ Property / cites work @@
+Optimal scrap combination for steel production
@@ Property / cites work: Optimal scrap combination for steel production / rank @@
+Normal rank
@@ Property / cites work @@
+Technical Note—An Improved Branch-and-Bound Method for Integer Programming
+Normal rank
@@ Property / cites work @@
+Q3372341
@@ Property / cites work: Q3372341 / rank @@
+Normal rank
@@ Property / cites work @@
+Octane: A New Heuristic for Pure 0–1 Programs
@@ Property / cites work: Octane: A New Heuristic for Pure 0–1 Programs / rank @@
+Normal rank
@@ Property / cites work @@
+The feasibility pump
@@ Property / cites work: The feasibility pump / rank @@
+Normal rank
@@ Property / cites work @@
+Active-constraint variable ordering for faster feasibility of mixed integer linear programs
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+MIPLIB 2003
@@ Property / cites work: MIPLIB 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Solutions of Knapsack Constraints
@@ Property / cites work: Counting Solutions of Knapsack Constraints / rank @@
+Normal rank