The following pages link to (Q4252288):
Displaying 27 items.
- There is no asymptotic PTAS for two-dimensional vector packing (Q293152) (← links)
- A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem (Q338852) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- Approximate composable truthful mechanism design (Q344791) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Optimization of multiweighing packing proceedings (Q1265241) (← 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)
- Constraint programming for planning test campaigns of communications satellites (Q1701233) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Mixed-criticality scheduling on multiprocessors (Q2251396) (← links)
- A two-dimensional vector packing model for the efficient use of coil cassettes (Q2387252) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Vector assignment schemes for asymmetric settings (Q2491210) (← links)
- Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem (Q2835671) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- Bidimensional Packing by Bilinear Programming (Q3596354) (← links)
- (Q4778564) (← links)
- On minimizing the makespan when some jobs cannot be assigned on the same machine (Q5111718) (← links)
- Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
- Higher‐Dimensional Packing with Order Constraints (Q5426891) (← links)
- Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
