NP-Complete operations research problems and approximation algorithms
From MaRDI portal
Publication:4187586
Cites work
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3557221 (Why is no real title available?)
- scientific article; zbMATH DE number 3576997 (Why is no real title available?)
- scientific article; zbMATH DE number 3583590 (Why is no real title available?)
- scientific article; zbMATH DE number 3589730 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- A Level Algorithm for Preemptive Scheduling
- Algorithms for Scheduling Independent Tasks
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- An Application of Bin-Packing to Multiprocessor Scheduling
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation Algorithms for Certain Scheduling Problems
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Bounds for Certain Multiprocessing Anomalies
- Bounds for LPT Schedules on Uniform Processors
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Bounds on Multiprocessing Timing Anomalies
- Combinatorial Problems: Reductibility and Approximation
- Complexity Results for Multiprocessor Scheduling under Resource Constraints
- Complexity of Scheduling under Precedence Constraints
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast algorithms for bin packing
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Hamiltonian circuits in random graphs
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- NP-complete scheduling problems
- On the Complexity of Mean Flow Time Scheduling
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the Computational Complexity of Combinatorial Problems
- Open Shop Scheduling to Minimize Finish Time
- Performance Guarantees for Scheduling Algorithms
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling independent tasks to reduce mean finishing time
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Some simplified NP-complete graph problems
- The Complexity of Flowshop and Jobshop Scheduling
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of theorem-proving procedures
- Two-Commodity Flow
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- `` Strong NP-Completeness Results
Cited in
(2)
This page was built for publication: NP-Complete operations research problems and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187586)
