The following pages link to Dong-lei Du (Q591600):
Displaying 50 items.
- Optimal replenishment strategy for inventory mechanism with step-shaped demand (Q2231340) (← links)
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem'' (Q2275586) (← links)
- LP-rounding approximation algorithms for two-stage stochastic fault-tolerant facility location problem (Q2295313) (← links)
- Maximization of constrained non-submodular functions (Q2300075) (← links)
- Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
- A note on submodularity preserved involving the rank functions (Q2326075) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
- An integrated admission control scheme for the delivery of streaming media (Q2369681) (← links)
- Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors (Q2386614) (← links)
- An approximation algorithm for the dynamic facility location problem with outliers (Q2421446) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
- Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
- Improved approximation algorithm for universal facility location problem with linear penalties (Q2424885) (← links)
- A primal-dual approximation algorithm for the facility location problem with submodular penalties (Q2429335) (← links)
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
- The complexity of two supply chain scheduling problems (Q2444850) (← links)
- The \(k\)-level facility location game (Q2466591) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- An improved algorithm for decomposing arc flows into multipath flows (Q2583709) (← links)
- The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems (Q2644350) (← links)
- Approximation algorithms for the lower bounded correlation clustering problem (Q2677653) (← links)
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost (Q2686108) (← links)
- Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines (Q2856147) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties (Q2920471) (← links)
- (Q2934584) (← links)
- Technical Note—A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula (Q2935298) (← links)
- An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem (Q2942463) (← links)
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
- (Q3129213) (← links)
- Improved Bounds for the Symmetric Rendezvous Value on the Line (Q3392207) (← links)
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties (Q3452561) (← links)
- Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties (Q3467834) (← links)
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm (Q3511439) (← links)
- A Primal-Dual Approximation Algorithm for the k-Level Stochastic Facility Location Problem (Q3578380) (← links)
- Robust Optimization Model for a Class of Uncertain Linear Programs (Q3611929) (← links)
- (Q4037895) (← links)
- (Q4233218) (← links)
- (Q4267313) (← links)
- (Q4351590) (← links)
- (Q4367129) (← links)
- (Q4528361) (← links)
- (Q4852133) (← links)
- Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty (Q4925246) (← links)
