Pages that link to "Item:Q4651495"

The following pages link to On Multidimensional Packing Problems (Q4651495):

Displaying 42 items.

• Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
• Approximation schemes for generalized two-dimensional vector packing with application to data placement (Q414421) (← links)
• Vector bin packing with multiple-choice (Q427903) (← links)
• Resource allocation algorithms for virtualized service hosting platforms (Q666218) (← links)
• Approximating vector scheduling: almost matching upper and lower bounds (Q727975) (← links)
• Optimization of multiweighing packing proceedings (Q1265241) (← links)
• Minimizing worst-case and average-case makespan over scenarios (Q1702655) (← links)
• Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
• Vector scheduling with rejection on a single machine (Q1743644) (← links)
• Integer programming models for mid-term production planning for high-tech low-volume supply chains (Q1749508) (← links)
• Selfish vector packing (Q1979465) (← links)
• Truthful mechanism design for bin packing with applications on cloud computing (Q2084605) (← links)
• Packing under convex quadratic constraints (Q2118134) (← links)
• Greedy algorithms for the profit-aware social team formation problem (Q2168713) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks (Q2251377) (← links)
• Mixed-criticality scheduling on multiprocessors (Q2251396) (← links)
• Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
• Online vector scheduling and generalized load balancing (Q2443018) (← links)
• Online two-dimensional vector packing with advice (Q2692736) (← links)
• Approximation Schemes for Robust Makespan Scheduling Problems (Q2806953) (← links)
• Selfish Vector Packing (Q3452809) (← links)
• Bidimensional Packing by Bilinear Programming (Q3596354) (← links)
• (Q4252288) (← links)
• Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
• (Q4778564) (← links)
• Vector scheduling with rejection on two machines (Q5031186) (← links)
• A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap (Q5084484) (← links)
• (Q5091067) (← links)
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem (Q5117310) (← links)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
• On capacitated covering with unit balls (Q5266149) (← links)
• Higher‐Dimensional Packing with Order Constraints (Q5426891) (← links)
• Consecutive ones matrices for multi-dimensional orthogonal packing problems (Q5891542) (← links)
• \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
• Streaming algorithms for bin packing and vector scheduling (Q5919096) (← links)
• An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
• There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• The preemptive resource allocation problem (Q6547132) (← links)
• Algorithms for the bin packing problem with scenarios (Q6646755) (← links)