Pages that link to "Item:Q1569936"
From MaRDI portal
The following pages link to Approximation algorithms for knapsack problems with cardinality constraints (Q1569936):
Displaying 50 items.
- The Subset Sum game (Q296979) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Committee selection under weight constraints (Q449043) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Order acceptance and scheduling with consideration of service level (Q513576) (← links)
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms (Q541729) (← links)
- Tight bounds for online class-constrained packing (Q596145) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Minimal cost reconfiguration of data placement in a storage area network (Q690477) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Polynomial time approximation schemes for class-constrained packing problems (Q1348737) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- A polyhedral study of the cardinality constrained knapsack problem (Q1404231) (← links)
- Randomized strategies for cardinality robustness in the knapsack problem (Q1675929) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- An approximation algorithm for a competitive facility location problem with network effects (Q1754226) (← links)
- Network pollution games (Q1755784) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- Two-dimensional knapsack-block packing problem (Q1984921) (← links)
- Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Multistage knapsack (Q2119404) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- On the complexity of working set selection (Q2381582) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Bin packing with general cost structures (Q2429476) (← links)
- Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times (Q2434321) (← links)
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights (Q2448903) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- Hybrid rounding techniques for knapsack problems (Q2489957) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Approximation algorithms for hard capacitated \(k\)-facility location problems (Q2630091) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- Product sequencing and pricing under cascade browse model (Q2661544) (← links)
- New Results for Network Pollution Games (Q2817847) (← links)
- (Q4941164) (← links)
- On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint (Q4965095) (← links)
