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):
Displaying 50 items.
- PTAS for densest \(k\)-subgraph in interval graphs (Q261389) (← links)
- The online knapsack problem with incremental capacity (Q283993) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
- Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube (Q375961) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- Optimal and efficient adaptation in distributed real-time systems with discrete rates (Q483961) (← links)
- Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable (Q489742) (← links)
- Bandwidth allocation in cellular networks with multiple interferences (Q494422) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Capacitated domination problem (Q534769) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Knapsack problem with probability constraints (Q628737) (← links)
- A job-shop problem with one additional resource type (Q640303) (← links)
- Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
- Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble (Q709664) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
- The zone hopping problem (Q750298) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Completeness in approximation classes (Q811119) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
- Scheduling vessels and container-yard operations with conflicting objectives (Q940925) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Partitioning graphs of supply and demand (Q967306) (← links)
- Playing monotone games to understand learning behaviors (Q974103) (← links)
