| Year |
Citation |
Score |
| 2017 |
Ćustić A, Zhang R, Punnen AP. The quadratic minimum spanning tree problem and its variations Discrete Optimization. 27: 73-87. DOI: 10.1016/J.Disopt.2017.09.003 |
0.662 |
|
| 2015 |
Zhang R. On configurations where the Loomis-Whitney inequality is nearly sharp and applications to the furstenberg set problem Mathematika. 61: 145-161. DOI: 10.1112/S0025579314000357 |
0.386 |
|
| 2013 |
Zhang R. A simulated annealing-based heuristic algorithm for job shop scheduling to minimize lateness: Regular paper International Journal of Advanced Robotic Systems. 10. DOI: 10.5772/55956 |
0.382 |
|
| 2013 |
Öncan T, Zhang R, Punnen AP. The minimum cost perfect matching problem with conflict pair constraints Computers and Operations Research. 40: 920-930. DOI: 10.1016/J.Cor.2012.10.022 |
0.642 |
|
| 2013 |
Zhang R, Punnen AP. Quadratic bottleneck knapsack problems Journal of Heuristics. 19: 573-589. DOI: 10.1007/S10732-011-9175-1 |
0.663 |
|
| 2012 |
Punnen AP, Zhang R. Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem Discrete Optimization. 9: 205-208. DOI: 10.1016/J.Disopt.2012.05.002 |
0.664 |
|
| 2011 |
Zhang R. A differential evolution algorithm for job shop scheduling problems involving due date determination decisions International Journal of Digital Content Technology and Its Applications. 5: 388-396. DOI: 10.4156/jdcta.vol5.issue7.48 |
0.329 |
|
| 2011 |
Zhang R. A hybrid heuristic based on constraint propagation for the job shop scheduling problem International Journal of Digital Content Technology and Its Applications. 5: 412-418. DOI: 10.4156/jdcta.vol5.issue10.49 |
0.414 |
|
| 2011 |
Zhang R. A simulated annealing algorithm integrated with probabilistic constraint propagation for job shop scheduling Journal of Convergence Information Technology. 6: 324-331. DOI: 10.4156/jcit.vol6.issue10.41 |
0.364 |
|
| 2011 |
Zhang R. Artificial bee colony algorithm for solving a bi-objective job shop scheduling problem Advances in Information Sciences and Service Sciences. 3: 319-326. DOI: 10.4156/aiss.vol3.issue8.39 |
0.403 |
|
| 2011 |
Zhang R. A genetic local search algorithm based on insertion neighborhood for the job shop scheduling problem Advances in Information Sciences and Service Sciences. 3: 117-125. DOI: 10.4156/aiss.vol3.issue5.15 |
0.309 |
|
| 2011 |
Zhang R. A Genetic algorithm for solving the job shop scheduling problem with identical (Exchangeable) jobs Advances in Information Sciences and Service Sciences. 3. DOI: 10.4156/AISS.vol3.issue11.5 |
0.345 |
|
| 2011 |
Zhang R. An artificial bee colony algorithm based on problem data properties for scheduling job shops Procedia Engineering. 23: 131-136. DOI: 10.1016/j.proeng.2011.11.2478 |
0.371 |
|
| 2011 |
Zhang R, Kabadi SN, Punnen AP. The minimum spanning tree problem with conflict constraints and its variations Discrete Optimization. 8: 191-205. DOI: 10.1016/J.Disopt.2010.08.001 |
0.689 |
|
| 2011 |
Punnen AP, Zhang R. Quadratic bottleneck problems Naval Research Logistics. 58: 153-164. DOI: 10.1002/Nav.20446 |
0.686 |
|
| 2009 |
Punnen AP, Zhang R. Bottleneck flows in unit capacity networks Information Processing Letters. 109: 334-338. DOI: 10.1016/J.Ipl.2008.11.011 |
0.608 |
|
| 2003 |
Zhang R. Multistage bilevel programming problems Optimization. 52: 605-616. DOI: 10.1080/02331930310001611420 |
0.338 |
|
| 2002 |
Zhang R. Scheduling for maximum capacity in SDMA/TDMA networks Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 3. |
0.357 |
|
| 2001 |
Zhang R. Optimal space-time packet scheduling for reservation ALOHA networks Ieee Vehicular Technology Conference. 4: 2188-2191. |
0.333 |
|
| Show low-probability matches. |