Fast Approximation Algorithms for Knapsack Problems

Cited in

(only showing first 100 items - show all)

A successive approximation algorithm for the multiple knapsack problem
A new heuristic algorithm for the machine scheduling problem with job delivery coordination
Scheduling jobs with time-resource tradeoff via nonlinear programming
Approximations to clustering and subgraph problems on trees
Approximation schemes for the subset-sum problem: Survey and experimental analysis
An asymptotically exact polynomial algorithm for equipartition problems
A compact labelling scheme for series-parallel graphs
The 2-quasi-greedy algorithm for cardinality constrained matroid bases
A new enumeration scheme for the knapsack problem
An approximation algorithm for solving unconstrained two-dimensional knapsack problems
An algorithm for the solution of the 0-1 knapsack problem
Probabilistic analysis of the subset-sum problem
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
An exact algorithm for the 0-1 collapsing knapsack problem
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
Approximation algorithms for the capacitated plant allocation problem
One-machine generalized precedence constrained scheduling problems
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
An improved heuristic for one-machine scheduling with delays constraints
Approximation algorithms and relaxations for a service provision problem on a telecommunication network
An efficient fully polynomial approximation scheme for the Subset-Sum problem.
Exact algorithms for the guillotine strip cutting/packing problem.
The multidimensional 0-1 knapsack problem: an overview.
Approximation algorithms for knapsack problems with cardinality constraints
The nonlinear knapsack problem - algorithms and applications
Optimizing a mail-order with discount and shipping costs
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
An exact algorithm for the modular hub location problem with single assignments
A new fully polynomial time approximation scheme for the interval subset sum problem
Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
A new linear storage, polynomial-time approximation scheme for the subset-sum problem
Heuristic methods and applications: A categorized survey
The quadratic 0-1 knapsack problem with series-parallel support
Approximation algorithms for fractional knapsack problems
A nonlinear knapsack problem
Computing knapsack solutions with cardinality robustness
A note on maximizing the spread of influence in social networks
Near optimal multiple choice index selection for relational databases
On fair price discrimination in multi-unit markets
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
Approximation schemes for multiperiod binary knapsack problems
An FPTAS for the -modular multidimensional knapsack problem
General bounds for incremental maximization
Multistage knapsack
On the approximability of the two-phase knapsack problem
On social envy-freeness in multi-unit markets
Estimating the probability of meeting a deadline in schedules and plans
An FPTAS for the parametric knapsack problem
Approximation schemes for a class of subset selection problems
Stochastic budget optimization in internet advertising
Approximation and online algorithms for multidimensional bin packing: a survey
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
Algorithms for the bounded set-up knapsack problem
Complexity and algorithms for nonlinear optimization problems
A fast asymptotic approximation scheme for bin packing with rejection
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
New approximability results for two-dimensional bin packing
Approximation algorithms for hard capacitated \(k\)-facility location problems
Integer knapsack problems with set-up weights
On inequalities with bounded coefficients and pitch for the min knapsack polytope
Convex relaxations and integrality gaps
Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
An approximate binary search algorithm for the multiple-choice knapsack problem
An improved binary search algorithm for the multiple-choice knapsack problem
The unbounded knapsack problem
Worst-case analysis of greedy algorithms for the subset-sum problem
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
A Polynomial Time Approximation Scheme for the Square Packing Problem
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Minimum and worst-case performance ratios of rollout algorithms
A Fast Approximation Algorithm For The Subset-Sum Problem
Minimum-diameter covering problems
Resource allocation problem under single resource assignment
Improved algorithm for resource allocation problems
Small extended formulation for knapsack cover inequalities from monotone circuits
Approximation schemes for machine scheduling with resource (in-)dependent processing times
Faster Pseudopolynomial Time Algorithms for Subset Sum
Pricing problems with buyer preselection
A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
An improved approximation scheme for variable-sized bin packing
Stochastic knapsack revisited: the service level perspective
scientific article; zbMATH DE number 7561569 (Why is no real title available?)
Multistage knapsack
scientific article; zbMATH DE number 7122316 (Why is no real title available?)
An exact algorithm for the subset sum problem
A pegging algorithm for the nonlinear resource allocation problem
Approximation algorithms for scheduling with reservations
Reoptimizing the 0-1 knapsack problem
Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
Coordinating monetary contributions in participatory budgeting
Local-search based heuristics for advertisement scheduling
An efficient heuristic for a real-life OAS problem
Lower bounds for matroid optimization problems with a linear constraint
Participatory budgeting with project groups
Average sensitivity of the knapsack problem
Assortment optimization under the multinomial logit choice model with product-specific capacities
Online unbounded knapsack
Knapsack and subset sum with small items
Weakly approximating knapsack in subquadratic time

This page was built for publication: Fast Approximation Algorithms for Knapsack Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3861164)