The following pages link to Yin-Feng Xu (Q1288472):
Displaying 50 items.
- (Q247808) (redirect page) (← links)
- Online integrated production-distribution scheduling problems without preemption (Q281801) (← links)
- Computing the optimal bridge between two convex polygons (Q294636) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- The approximation algorithms for a class of multiple-choice problem (Q344788) (← links)
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- Optimal algorithms for online time series search and one-way trading with interrelated prices (Q421255) (← links)
- An optimal online algorithm for single machine scheduling to minimize total general completion time (Q421265) (← links)
- New results on single-machine scheduling with past-sequence-dependent delivery times (Q441858) (← links)
- Single-machine scheduling with past-sequence-dependent delivery times and release times (Q456143) (← links)
- Minimax regret 1-sink location problem in dynamic cycle networks (Q477612) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- Online MapReduce scheduling problem of minimizing the makespan (Q511710) (← links)
- Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
- Consistency issues of interval pairwise comparison matrices (Q521699) (← links)
- Online makespan minimization in MapReduce-like systems with complex reduce tasks (Q526409) (← links)
- Optimal algorithms for the online time series search problem (Q621833) (← links)
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449) (← links)
- Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260) (← links)
- Online leasing problem with price fluctuations under the consumer price index (Q721934) (← links)
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead (Q721944) (← links)
- Creating an acceptable consensus ranking for group decision making (Q724762) (← links)
- Finding an anti-risk path between two nodes in undirected graphs (Q732313) (← links)
- Single vehicle's package delivery strategy with online traffic congestion of certain delay time (Q777295) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
- On reciprocity indexes in the aggregation of fuzzy preference relations using the OWA operator (Q834454) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q861287) (← links)
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- Semi-online hierarchical load balancing problem with bounded processing times (Q897964) (← links)
- An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- Linguistic multiperson decision making based on the use of multiple preference relations (Q1037883) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction (Q1041756) (← links)
- A tight lower bound for job scheduling with cancellation (Q1044744) (← links)
- The OWA-based consensus operator under linguistic representation models using position indexes (Q1046120) (← links)
- Constant-level greedy triangulations approximate the MWT well (Q1288473) (← links)
- Computing a minimum weight triangulation of a sparse point set (Q1304398) (← links)
- Competitive analysis of online revenue management with hierarchical resources (Q1628685) (← links)
- The mixed center location problem (Q1631666) (← links)
