Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for quadratic knapsack problems
@@ Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On polynomial solvability of the high multiplicity total weighted tardiness problem
+Normal rank
@@ Property / cites work @@
+Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Convex separable optimization is not much harder than linear optimization
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for an integer quadratic non-separable transportation problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Minimizing Average Flow Time with Parallel Machines
+Normal rank
@@ Property / cites work @@
+Q4286721
@@ Property / cites work: Q4286721 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving integer minimum cost flows with separable convex cost objective polynomially
+Normal rank
@@ Property / cites work @@
+An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
+Normal rank
@@ Property / cites work @@
+A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
+Normal rank