Pages that link to "Item:Q1583697"
From MaRDI portal
The following pages link to Approximation algorithms for the multiple knapsack problem with assignment restrictions (Q1583697):
Displaying 26 items.
- Distributed approximation of cellular coverage (Q433421) (← links)
- The food bank resource allocation problem (Q828769) (← links)
- An efficient approximation for the generalized assignment problem (Q845859) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
- A two-stage model for a day-ahead paratransit planning problem (Q1014313) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
- Flexible allocation on related machines with assignment restrictions (Q1801074) (← links)
- The assignment and loading transportation problem (Q2029276) (← links)
- A branch-and-bound algorithm for the quadratic multiple knapsack problem (Q2076914) (← links)
- Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem (Q2494823) (← links)
- Optimization in production quota problem with convex cost function (Q2497848) (← links)
- Upper and lower bounding procedures for the multiple knapsack assignment problem (Q2514873) (← links)
- The influence of the fitness evaluation method on the performance of multiobjective search algorithms (Q2572858) (← links)
- Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
- Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- Multiple subset sum with inclusive assignment set restrictions (Q5300451) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles (Q6551138) (← links)
- Airports and railways with unsplittable demand (Q6663529) (← links)
