Pages that link to "Item:Q1904613"
From MaRDI portal
The following pages link to Improving the complexities of approximation algorithms for optimization problems (Q1904613):
Displayed 24 items.
- A theoretical development for the total tardiness problem and its application in branch and bound algorithms (Q339575) (← links)
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem (Q439504) (← links)
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114) (← links)
- Integrated production and delivery scheduling with disjoint windows (Q972326) (← links)
- FPTAS for half-products minimization with scheduling applications (Q1005250) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690) (← links)
- Single machine scheduling subject to deadlines and resource dependent processing times (Q1278308) (← links)
- Errata and comments on ``Approximation algorithms for the capacitated plant allocation problem'' (Q1919191) (← links)
- Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
- An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) (← links)
- Provision-after-wait with preferences ordered by difference: tighter complexity and better approximation (Q2029277) (← links)
- Metric approach for finding approximate solutions of scheduling problems (Q2048806) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) (← links)
- Batch scheduling and common due-date assignment on a single machine (Q2563922) (← links)
- An FPTAS for SM‐CELS problem with monotone cost functions (Q3579135) (← links)
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)
- Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)