NP-Complete operations research problems and approximation algorithms (Q4187586): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4152035
@@ Property / cites work: Q4152035 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Scheduling independent tasks to reduce mean finishing time
+Normal rank
@@ Property / cites work @@
+Q4131987
@@ Property / cites work: Q4131987 / rank @@
+Normal rank
@@ Property / cites work @@
+An Application of Bin-Packing to Multiprocessor Scheduling
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Bounds for Multiprocessor Scheduling with Resource Constraints
+Normal rank
@@ Property / cites work @@
+Performance Guarantees for Scheduling Algorithms
@@ Property / cites work: Performance Guarantees for Scheduling Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Multiprocessor Scheduling under Resource Constraints
+Normal rank
@@ Property / cites work @@
+Scheduling Tasks with Nonuniform Deadlines on Two Processors
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Bounds for LPT Schedules on Uniform Processors
@@ Property / cites work: Bounds for LPT Schedules on Uniform Processors / rank @@
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Flowshop and Jobshop Schedules: Complexity and Approximation
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and Approximate Algorithms for Scheduling Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+A Level Algorithm for Preemptive Scheduling
@@ Property / cites work: A Level Algorithm for Preemptive Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Commodity Flow
@@ Property / cites work: Two-Commodity Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Certain Scheduling Problems
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
+Normal rank
@@ Property / cites work @@
+An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Q4055144
@@ Property / cites work: Q4055144 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q4194705
@@ Property / cites work: Q4194705 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4133122
@@ Property / cites work: Q4133122 / rank @@
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+Q4146536
@@ Property / cites work: Q4146536 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits in random graphs
@@ Property / cites work: Hamiltonian circuits in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Independent Tasks
@@ Property / cites work: Algorithms for Scheduling Independent Tasks / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Problems: Reductibility and Approximation
+Normal rank
@@ Property / cites work @@
+Q4157951
@@ Property / cites work: Q4157951 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Mean Flow Time Scheduling
@@ Property / cites work: On the Complexity of Mean Flow Time Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+NP-complete scheduling problems
@@ Property / cites work: NP-complete scheduling problems / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4187586