Pages that link to "Item:Q3861164"

The following pages link to Fast Approximation Algorithms for Knapsack Problems (Q3861164):

Displaying 50 items.

• New approximability results for two-dimensional bin packing (Q261358) (← links)
• An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
• Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
• An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
• Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
• Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
• The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
• An efficient approximation for the generalized assignment problem (Q845859) (← links)
• Improved algorithms for two single machine scheduling problems (Q860871) (← links)
• On the machine scheduling problem with job delivery coordination (Q884029) (← links)
• Some extended knapsack problems involving job partition between two parties (Q933034) (← links)
• Nonconvex piecewise linear knapsack problems (Q948649) (← links)
• A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination (Q1029329) (← links)
• Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
• Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
• Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
• An asymptotically exact polynomial algorithm for equipartition problems (Q1076607) (← links)
• A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
• The 2-quasi-greedy algorithm for cardinality constrained matroid bases (Q1079134) (← links)
• A new enumeration scheme for the knapsack problem (Q1095029) (← links)
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
• An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
• Probabilistic analysis of the subset-sum problem (Q1168896) (← links)
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
• An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
• One-machine generalized precedence constrained scheduling problems (Q1342279) (← links)
• An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks (Q1370664) (← links)
• An improved heuristic for one-machine scheduling with delays constraints (Q1373850) (← links)
• Approximation algorithms and relaxations for a service provision problem on a telecommunication network (Q1399109) (← links)
• An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
• Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Optimizing a mail-order with discount and shipping costs (Q1603552) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
• A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
• A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
• Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
• A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)