Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997): Difference between revisions

@@ Property / cites work @@
+Pivot and Complement–A Heuristic for 0-1 Programming
+Normal rank
@@ Property / cites work @@
+Q4133397
@@ Property / cites work: Q4133397 / rank @@
+Normal rank
@@ Property / cites work @@
+Calculating surrogate constraints
@@ Property / cites work: Calculating surrogate constraints / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the solution of the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Efficient Heuristic Procedures for Integer Linear Programming with an Interior
+Normal rank
@@ Property / cites work @@
+New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Heuristic improvement methods: How should starting solutions be chosen?
+Normal rank
@@ Property / cites work @@
+An Approach to Solving Linear Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Enumerative Methods in Integer Programming
@@ Property / cites work: Enumerative Methods in Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
+Normal rank