The following pages link to (Q4941826):
Displaying 13 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints (Q417989) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- On maximizing the throughput of multiprocessor tasks. (Q1401335) (← links)
- Optimizing a mail-order with discount and shipping costs (Q1603552) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Online algorithms with advice for the dual bin packing problem (Q1642809) (← links)
- Scheduling multiple two-stage flowshops with a deadline (Q2140576) (← links)
- Scheduling on multiple two-stage flowshops with a deadline (Q2151364) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint (Q2672605) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version (Q5240422) (← links)
