The following pages link to Xin Han (Q388091):
Displaying 50 items.
- 2D knapsack: packing squares (Q388093) (← links)
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) (Q392175) (← links)
- Online removable knapsack with limited cuts (Q410717) (← links)
- Online scheduling with one rearrangement at the end: revisited (Q456073) (← links)
- Randomized algorithms for online knapsack problems (Q476887) (← links)
- Online unweighted knapsack problem with removal cost (Q486978) (← links)
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- Online multiple-strip packing (Q621841) (← links)
- Online scheduling with rearrangement on two related machines (Q627161) (← links)
- Optimal algorithms for online scheduling with bounded rearrangement at the end (Q653317) (← links)
- Deadline scheduling and power management for speed bounded processors (Q708210) (← links)
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing (Q744097) (← links)
- Online call control in cellular networks revisited (Q763482) (← links)
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\) (Q888964) (← links)
- Online minimization knapsack problem (Q897874) (← links)
- Modified dispersion relations and (A)dS Schwarzschild black holes (Q901750) (← links)
- Online removable square packing (Q927402) (← links)
- A note on on-line broadcast scheduling with deadlines (Q976075) (← links)
- Deterministic on-line call control in cellular networks (Q982658) (← links)
- A note on online strip packing (Q1029271) (← links)
- Dynamic bin packing with unit fraction items revisited (Q1675820) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Online buffer management for transmitting packets with processing cycles (Q1708032) (← links)
- A general bin packing game: interest taken into account (Q1750357) (← links)
- Semi-online hierarchical scheduling problems with buffer or rearrangements (Q1943630) (← links)
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
- Approximation algorithms for two-stage flexible flow shop scheduling (Q2292124) (← links)
- Online knapsack problem under concave functions (Q2319907) (← links)
- Unit cost buyback problem (Q2322706) (← links)
- Online bin packing with \((1,1)\) and \((2,R)\) bins (Q2355985) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Proportional cost buyback problem with weight bounds (Q2424877) (← links)
- Online removable knapsack problem under convex function (Q2453163) (← links)
- A fast asymptotic approximation scheme for bin packing with rejection (Q2481948) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- A Harmonic Algorithm for the 3D Strip Packing Problem (Q2840983) (← links)
- Online Bin Packing with (1,1) and (2,R) Bins (Q2867137) (← links)
- Unit Cost Buyback Problem (Q2872107) (← links)
- The Train Delivery Problem Revisited (Q2872124) (← links)
- Online Minimum Makespan Scheduling with a Buffer (Q2897991) (← links)
- Online Knapsack Problem with Removal Cost (Q2914312) (← links)
- ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER (Q2929632) (← links)
- (Q2934715) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing (Q3004684) (← links)
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing (Q3060778) (← links)
