Improving the complexities of approximation algorithms for optimization problems
From MaRDI portal
Recommendations
- On approximating NP-hard optimization problems
- scientific article; zbMATH DE number 1944142
- scientific article; zbMATH DE number 847149
- scientific article; zbMATH DE number 1086675
- Approximate solution of NP optimization problems
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
- The complexity of approximation reoptimization algorithms for discrete optimization
- Complexity of approximating bounded variants of optimization problems
- Complexity and approximation in reoptimization
- ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS
Cites work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A fully polynomial approximation scheme for the total tardiness problem
- Algorithms for Scheduling Independent Tasks
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Fast approximation algorithm for job sequencing with deadlines
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- Single Machine Scheduling to Minimize Total Late Work
Cited in
(29)- FPTAS for half-products minimization with scheduling applications
- The single-machine total tardiness scheduling problem: review and extensions
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- Single machine scheduling subject to deadlines and resource dependent processing times
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem
- Min-max and min-max (relative) regret approaches to representatives selection problem
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
- Expected improvement for expensive optimization: a review
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation
- Metric approach for finding approximate solutions of scheduling problems
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Approximation issues of fractional knapsack with penalties: a note
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Complexity of approximating bounded variants of optimization problems
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Batch scheduling and common due-date assignment on a single machine
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms
- An FPTAS for SM-CELS problem with monotone cost functions
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs
- Integer knapsack problems with profit functions of the same value range
- Approximate solution of NP optimization problems
- Single machine controllable scheduling with bounded makespan
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- Integrated production and delivery scheduling with disjoint windows
This page was built for publication: Improving the complexities of approximation algorithms for optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904613)
