The following pages link to Jian Li (Q290319):
Displaying 21 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- (Q368757) (redirect page) (← links)
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- (Q500976) (redirect page) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Risk management of supply and cash flows in supply chains (Q549284) (← links)
- Analyses of location-price game on networks with stochastic customer behavior and its heuristic algorithm (Q625687) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- Forecasting time series with genetic programming based on least square method (Q741884) (← links)
- Range queries on uncertain data (Q897858) (← links)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
- A two-stage mechanism for ordinal peer assessment (Q1617663) (← links)
- Electronic markets selection in supply chain with uncertain demand and uncertain price (Q1667009) (← links)
- (Q4606321) (← links)
- Almost All Even Yao-Yao Graphs Are Spanners (Q4606334) (← links)
- (Q5002731) (← links)
- Odd Yao-Yao Graphs are Not Spanners (Q5115817) (← links)
- (Q5116489) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- (Q5874506) (← links)