Pages that link to "Item:Q5470710"
From MaRDI portal
The following pages link to A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem (Q5470710):
Displaying 50 items.
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Approximation schemes for single machine scheduling with non-renewable resource constraints (Q398908) (← links)
- Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints (Q417989) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- Knapsack with variable weights satisfying linear constraints (Q1683329) (← links)
- Recovery strategies from major supply disruptions in single and multiple sourcing networks (Q1713742) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- The packing while traveling problem (Q1751654) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- Minimum cost partitions of trees with supply and demand (Q1934311) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Target-based computer-assisted orchestration: complexity and approximation algorithms (Q2079398) (← links)
- Private non-monotone submodular maximization (Q2091093) (← links)
- Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
- A polynomial-time approximation scheme for the MAXSPACE advertisement problem (Q2132409) (← links)
- Scheduling multiple two-stage flowshops with a deadline (Q2140576) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Scheduling on multiple two-stage flowshops with a deadline (Q2151364) (← links)
- Two-machine flow shops with an optimal permutation schedule under a storage constraint (Q2197318) (← links)
- A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function (Q2202007) (← links)
- On the approximability of the two-phase knapsack problem (Q2279756) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Packing items into several bins facilitates approximating the separable assignment problem (Q2345851) (← links)
- Stochastic budget optimization in internet advertising (Q2392928) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- Approximation algorithms for the generalized incremental knapsack problem (Q2687039) (← links)
- A Fast Approximation Scheme for the Multiple Knapsack Problem (Q2891378) (← links)
- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint (Q3512451) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem (Q4558310) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- (Q5075815) (← links)
- A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
