Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximability of partitioning graphs with supply and demand
- FPTAS for half-products minimization with scheduling applications
- Approximated consistency for the automatic recording constraint
- Approximate solution of the control problem of supplies with many intervals and concave cost functions
- Approximation algorithms for single machine scheduling with one unavailability period
- A successive approximation algorithm for the multiple knapsack problem
- Priority algorithms for the subset-sum problem
- Weighted sum coloring in batch scheduling of conflicting jobs
- Approximation algorithms for orthogonal packing problems for hypercubes
- Scheduling three chains on two parallel machines
- Approximation schemes for the subset-sum problem: Survey and experimental analysis
- An asymptotically exact polynomial algorithm for equipartition problems
- On different approximation criteria for subset product problems
- Parallel approximation schemes for subset sum and knapsack problems
- The principle of optimality in the design of efficient algorithms
- A new enumeration scheme for the knapsack problem
- The knapsack problem with generalized upper bounds
- Ratio combinatorial programs
- Non deterministic polynomial optimization problems and their approximations
- Discrete extremal problems
- Fast approximation algorithm for job sequencing with deadlines
- General approximation algorithms for some arithmetical combinatorial problems
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Bin packing can be solved within 1+epsilon in linear time
- A heuristic method for the design of minimum weight trusses using discrete member sizes
- Embedding decision-analytic control in a learning architecture
- A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
- A total-value greedy heuristic for the integer knapsack problem
- Approximate algorithms for some generalized knapsack problems
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Approximation algorithms for the capacitated plant allocation problem
- Joint performance of greedy heuristics for the integer knapsack problem
- Polynomial time approximation schemes for class-constrained packing problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- On fixed-parameter tractability and approximability of NP optimization problems
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network
- Complexity and approximability results for slicing floorplan designs.
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- A PTAS for weight constrained Steiner trees in series--parallel graphs.
- Exact algorithms for the guillotine strip cutting/packing problem.
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- The multidimensional 0-1 knapsack problem: an overview.
- On the two-dimensional knapsack problem
- Parallel machine batching and scheduling with deadlines
- Approximation algorithms for knapsack problems with cardinality constraints
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Optimizing a mail-order with discount and shipping costs
- Efficient approximation algorithms for the subset-sums equality problem.
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- A new fully polynomial time approximation scheme for the interval subset sum problem
- Ranking robustness and its application to evacuation planning
- Knapsack with variable weights satisfying linear constraints
- Greedy algorithms for the single-demand facility location problem
- Distributed approximation of k-service assignment
- A universally-truthful approximation scheme for multi-unit auctions
- Robust single machine scheduling with a flexible maintenance activity
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- Minimization of ordered, symmetric half-products
- Approximation of the supply scheduling problem
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space
- Lift-and-project methods for set cover and knapsack
- Stochastic on-line knapsack problems
- Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- Least-cost partition algorithms
- Heuristic methods and applications: A categorized survey
- On weighted vs unweighted versions of combinatorial optimization problems
- The quadratic 0-1 knapsack problem with series-parallel support
- An efficient pruning algorithm for value independent knapsack problem using a DAG structure
- A nonlinear knapsack problem
- Computing knapsack solutions with cardinality robustness
- The knapsack problem with neighbour constraints
- Minimum cost partitions of trees with supply and demand
- Approximation for knapsack problems with multiple constraints
- Online budgeted maximum coverage
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
- Scheduling many types of calibrations
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Techniques and results on approximation algorithms for packing circles
- Strongly polynomial FPTASes for monotone dynamic programs
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Approximation schemes for multiperiod binary knapsack problems
- An FPTAS for the -modular multidimensional knapsack problem
- General bounds for incremental maximization
- Packing under convex quadratic constraints
- Multistage knapsack
- On regularity of Max-CSPs and Min-CSPs
- The platform design problem
- The stochastic bilevel continuous knapsack problem with uncertain follower's objective
- Selecting a subset of diverse points based on the squared Euclidean distance
- Approximation schemes for subset-sums ratio problems
- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees
- Lower bounds on the performance of online algorithms for relaxed packing problems
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- Group parking permit problems
This page was built for publication: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4114965)
