Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883): Difference between revisions

@@ Property / cites work @@
+Scheduling jobs with fixed start and end times
@@ Property / cites work: Scheduling jobs with fixed start and end times / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian Relaxation Approach To The Classroom Assignment Problem<sup>*</sup>
+Normal rank
@@ Property / cites work @@
+Games of Boldness, Where the Player Performing the Hardest Task Wins
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+The Fixed Job Schedule Problem with Spread-Time Constraints
+Normal rank
@@ Property / cites work @@
+The Fixed Job Schedule Problem with Working-Time Constraints
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Fixed Job Schedule Problems
+Normal rank
@@ Property / cites work @@
+The Lagrangian Relaxation Method for Solving Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Q4178782
@@ Property / cites work: Q4178782 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Resources for Fixed and Variable Job Schedules
+Normal rank
@@ Property / cites work @@
+An Optimal Solution for the Channel-Assignment Problem
+Normal rank
@@ Property / cites work @@
+On the computational complexity of (maximum) class scheduling
+Normal rank
@@ Property / cites work @@
+License class design: Complexity and algorithms
@@ Property / cites work: License class design: Complexity and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+On the facial structure of set packing polyhedra
@@ Property / cites work: On the facial structure of set packing polyhedra / rank @@
+Normal rank