Discrete optimization by optimal control methods. I: Separable problems (Q2457533): Difference between revisions

@@ Property / cites work @@
+Q3340546
@@ Property / cites work: Q3340546 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Methods for Pure Nonlinear Integer Programming
+Normal rank
@@ Property / cites work @@
+Q3026739
@@ Property / cites work: Q3026739 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3820366
@@ Property / cites work: Q3820366 / rank @@
+Normal rank
@@ Property / cites work @@
+Methods of Nonlinear 0-1 Programming
@@ Property / cites work: Methods of Nonlinear 0-1 Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Branch and Bound Experiments in Convex Nonlinear Integer Programming
+Normal rank
@@ Property / cites work @@
+Q3215871
@@ Property / cites work: Q3215871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514046
@@ Property / cites work: Q5514046 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4077391
@@ Property / cites work: Q4077391 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimax problem of the travelling salesman. II: Dual approach
+Normal rank
@@ Property / cites work @@
+Q4021375
@@ Property / cites work: Q4021375 / rank @@
+Normal rank
@@ Property / cites work @@
+State-space relaxation procedures for the computation of bounds to routing problems
+Normal rank
@@ Property / cites work @@
+Q3494382
@@ Property / cites work: Q3494382 / rank @@
+Normal rank
@@ Property / cites work @@
+Reduced complexity dynamic programming based on policy iteration
+Normal rank