The following pages link to Da-Chuan Xu (Q692667):
Displaying 50 items.
- (Q278733) (redirect page) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
- An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)
- A primal-dual approximation algorithm for stochastic facility location problem with service installation costs (Q644537) (← links)
- A sparse enhanced indexation model with chance and cardinality constraints (Q683716) (← links)
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems (Q683730) (← links)
- Fault-tolerant concave facility location problem with uniform requirements (Q692668) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Improved approximation algorithms for the facility location problems with linear/submodular penalties (Q747629) (← links)
- Streaming algorithms for robust submodular maximization (Q827610) (← links)
- Approximation of dense-\(\frac n2\)-subgraph and table compression problems (Q882965) (← links)
- A cost-sharing method for the multi-level economic lot-sizing game (Q893607) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- Approximation algorithm for facility location with service installation costs (Q924885) (← links)
- A cost-sharing method for an economic lot-sizing game (Q1015308) (← links)
- (Q1047874) (redirect page) (← links)
- A cross-monotonic cost sharing method for the facility location game with service installation costs (Q1047875) (← links)
- Improved approximation algorithms for MAX \(\frac{n}2\)-DIRECTED-BISECTION and MAX \(\frac{n}2\)-DENSE-SUBGRAPH (Q1430177) (← links)
- Existence theorems of solution to variational inequality problems (Q1609630) (← links)
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem (Q1609708) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities (Q1690580) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximation algorithms for maximum coverage with group budget constraints (Q1708624) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
- Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain (Q1753138) (← links)
- (Q1873572) (redirect page) (← links)
- Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch (Q1873573) (← links)
- Approximation algorithm for MAX DICUT with given sizes of parts (Q1879136) (← links)
- A nonmonotone trust region algorithm for unconstrained nonsmooth optimization (Q1913923) (← links)
- A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties (Q1945937) (← links)
- A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties (Q2015801) (← links)
- An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
