A dynamic programming algorithm for multiple-choice constraints (Q798257): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(84)90055-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2060712332
@@ Property / OpenAlex ID: W2060712332 / rank @@
+Normal rank
@@ Property / cites work @@
+An integer programming approach to a class of combinatorial problems
+Normal rank
@@ Property / cites work @@
+Quadratic knapsack problems
@@ Property / cites work: Quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
+Normal rank
@@ Property / cites work @@
+The Multiple-Choice Knapsack Problem
@@ Property / cites work: The Multiple-Choice Knapsack Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Non-linear integer programming
@@ Property / cites work: Non-linear integer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear integer programming for various forms of constraints
+Normal rank
@@ Property / cites work @@
+An integer programming algorithm for portfolio selection with fixed charges
+Normal rank
@@ Property / cites work @@
+Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
+Normal rank
@@ Property / cites work @@
+Q3908789
@@ Property / cites work: Q3908789 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and Bound Methods for Multi-Item Scheduling
+Normal rank