Pages that link to "Item:Q789319"

The following pages link to Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319):

Displaying 41 items.

• Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
• Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
• Vector bin packing with multiple-choice (Q427903) (← links)
• Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
• There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• A PTAS for capacitated sum-of-ratios optimization (Q833588) (← links)
• A probabilistic analysis of the multiknapsack value function (Q909581) (← links)
• On the growth of random knapsacks (Q916565) (← links)
• The growth of m-constraint random knapsacks (Q920844) (← links)
• A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
• The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem (Q1280190) (← links)
• Random sequencing jobs with deadlines problem: Growth of the optimal solution values (Q1296705) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• The growth of multi-constraint random knapsack with various right-hand sides of the constraints (Q1328623) (← links)
• Approximation algorithms for the capacitated plant allocation problem (Q1332940) (← links)
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
• Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
• The growth of multi-constraint random knapsacks with large right-hand sides of the constraints (Q1371952) (← links)
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
• Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
• Connectivity interdiction (Q1785279) (← links)
• A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
• A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
• Multistage knapsack (Q2119404) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem (Q2503277) (← links)
• Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
• An improved binary search algorithm for the Multiple-Choice Knapsack Problem (Q2954365) (← links)
• Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model (Q3465583) (← links)
• Technical Note—Capacitated Assortment Optimization: Hardness and Approximation (Q5080651) (← links)
• (Q5092381) (← links)