An efficient algorithm for multi-dimensional nonlinear knapsack problems (Q5423360): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11741-006-0079-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2054627568
@@ Property / OpenAlex ID: W2054627568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+The nonlinear knapsack problem - algorithms and applications
+Normal rank
@@ Property / cites work @@
+The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
+Normal rank
@@ Property / cites work @@
+A hybrid method for solving nonlinear knapsack problems
+Normal rank
@@ Property / cites work @@
+A hybrid approach to discrete mathematical programming
+Normal rank
@@ Property / cites work @@
+Branch and Bound Experiments in Convex Nonlinear Integer Programming
+Normal rank
@@ Property / cites work @@
+A Survey of Methods for Pure Nonlinear Integer Programming
+Normal rank
@@ Property / cites work @@
+Convergent Lagrangian and domain cut method for nonlinear knapsack problems
+Normal rank
@@ Property / cites work @@
+Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
+Normal rank