Pages that link to "Item:Q4114965"
From MaRDI portal
The following pages link to Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems (Q4114965):
Displayed 50 items.
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- Least-cost partition algorithms (Q1823166) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure (Q1891244) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- The knapsack problem with neighbour constraints (Q1932367) (← links)
- Minimum cost partitions of trees with supply and demand (Q1934311) (← links)
- Approximation for knapsack problems with multiple constraints (Q1964357) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
- Scheduling many types of calibrations (Q2039673) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Multistage knapsack (Q2119404) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- The platform design problem (Q2152125) (← links)
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective (Q2156390) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees (Q2168712) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations (Q2169968) (← links)
- Group parking permit problems (Q2184679) (← links)
- Approximating connected safe sets in weighted trees (Q2184684) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Scheduling with variable-length calibrations: two agreeable variants (Q2232596) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Dividing splittable goods evenly and with limited fragmentation (Q2309472) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- On a class of covering problems with variable capacities in wireless networks (Q2339450) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)