| Year |
Citation |
Score |
| 2017 |
Venkateshan P, Ballou RH, Mathur K, Maruthasalam APP. A Two-echelon joint continuous-discrete location model European Journal of Operational Research. 262: 1028-1039. DOI: 10.1016/J.Ejor.2017.03.077 |
0.746 |
|
| 2015 |
Venkateshan P, Mathur K. A heuristic for the multisource weber problem with service level constraints Transportation Science. 49: 472-483. DOI: 10.1287/Trsc.2014.0547 |
0.765 |
|
| 2013 |
Mathur K, Süer GA. Math modeling and GA approach to simultaneously make overtime decisions, load cells and sequence products Computers and Industrial Engineering. 66: 614-624. DOI: 10.1016/J.Cie.2013.08.012 |
0.395 |
|
| 2012 |
Mathur K, Suer GA. A mathematical model to minimize total tardiness and workforce overtime costs in cellular manufacturing Proceedings of International Conference On Computers and Industrial Engineering, Cie. 2: 1167-1176. |
0.457 |
|
| 2011 |
Venkateshan P, Mathur K. An efficient column-generation-based algorithm for solving a pickup-and-delivery problem Computers and Operations Research. 38: 1647-1655. DOI: 10.1016/J.Cor.2011.02.009 |
0.757 |
|
| 2010 |
Venkateshan P, Mathur K, Ballou RH. Locating and staffing service centers under service level constraints European Journal of Operational Research. 201: 55-70. DOI: 10.1016/J.Ejor.2009.02.004 |
0.717 |
|
| 2008 |
Venkateshan P, Mathur K, Ballou RH. An efficient generalized network-simplex-based algorithm for manufacturing network flows Journal of Combinatorial Optimization. 15: 315-341. DOI: 10.1007/S10878-007-9080-6 |
0.709 |
|
| 2007 |
Janakiraman V, Mathur K, Baskaran H. Optimal planar flow network designs for tissue engineered constructs with built-in vasculature. Annals of Biomedical Engineering. 35: 337-47. PMID 17203399 DOI: 10.1007/S10439-006-9235-0 |
0.375 |
|
| 2007 |
Jung J, Mathur K. An efficient heuristic algorithm for a two-echelon joint inventory and routing problem Transportation Science. 41: 55-73. DOI: 10.1287/Trsc.1060.0160 |
0.541 |
|
| 2007 |
Mathur K, Venkateshan P. A new lower bound for the linear knapsack problem with general integer variables European Journal of Operational Research. 178: 738-754. DOI: 10.1016/J.Ejor.2006.02.018 |
0.75 |
|
| 2007 |
Alshamrani A, Mathur K, Ballou RH. Reverse logistics: simultaneous design of delivery routes and returns strategies Computers & Operations Research. 34: 595-619. DOI: 10.1016/J.Cor.2005.03.015 |
0.734 |
|
| 2003 |
Arunapuram S, Mathur K, Solow D. Vehicle Routing and Scheduling with Full Truckloads Transportation Science. 37: 170-182. DOI: 10.1287/Trsc.37.2.170.15248 |
0.594 |
|
| 2000 |
Yang W, Mathur K, Ballou RH. Stochastic Vehicle Routing Problem with Restocking Transportation Science. 34: 99-112. DOI: 10.1287/Trsc.34.1.99.12278 |
0.564 |
|
| 1999 |
Mathur K, Ritchken P. Minimum option prices under decreasing absolute risk aversion Review of Derivatives Research. 3: 135-156. DOI: 10.1023/A:1009602426513 |
0.304 |
|
| 1998 |
Agbegha GY, Ballou RH, Mathur K. Optimizing Auto-Carrier Loading Transportation Science. 32: 174-188. DOI: 10.1287/Trsc.32.2.174 |
0.475 |
|
| 1998 |
Mathur K. An integer-programming-based heuristic for the balanced loading problem Operations Research Letters. 22: 19-25. DOI: 10.1016/S0167-6377(97)00044-8 |
0.523 |
|
| 1997 |
Viswanathan S, Mathur K. Integrating routing and inventory decisions in one-warehouse multiretailer multiproduct distribution systems Management Science. 43: 294-312. DOI: 10.1287/Mnsc.43.3.294 |
0.48 |
|
| 1995 |
Mathur K, Puri MC. A bilevel bottleneck programming problem European Journal of Operational Research. 86: 337-344. DOI: 10.1016/0377-2217(94)00106-M |
0.401 |
|
| 1995 |
Emmons H, Mathur K. Lot sizing in a no-wait flow shop Operations Research Letters. 17: 159-164. DOI: 10.1016/0167-6377(95)00008-8 |
0.441 |
|
| 1994 |
Mohanty BB, Mathur K, Ivancic NJ. Value considerations in three-dimensional packing -- A heuristic procedure using the fractional knapsack problem European Journal of Operational Research. 74: 143-151. DOI: 10.1016/0377-2217(94)90212-7 |
0.547 |
|
| 1993 |
Mathur K, Bansal S, Puri MC. Bicriteria Bottleneck Linear Programming Problem Optimization. 28: 165-170. DOI: 10.1080/02331939308843911 |
0.367 |
|
| 1989 |
Agarwal Y, Mathur K, Salkin HM. A set‐partitioning‐based exact algorithm for the vehicle routing problem Networks. 19: 731-749. DOI: 10.1002/Net.3230190702 |
0.505 |
|
| 1988 |
Djerdjour M, Mathur K, Salkin HM. A surrogate relaxation based algorithm for a general quadratic multi-dimensional knapsack problem Operations Research Letters. 7: 253-258. DOI: 10.1016/0167-6377(88)90041-7 |
0.551 |
|
| 1986 |
Mathur K, Salkin HM, Mohanty BB. A note on a general non-linear knapsack problem Operations Research Letters. 5: 79-81. DOI: 10.1016/0167-6377(86)90107-0 |
0.528 |
|
| 1985 |
Mathur K, Salkin HM, Nishimura K, Morito S. Applications of integer programming in radio frequency management Management Science. 31: 829-839. DOI: 10.1287/Mnsc.31.7.829 |
0.453 |
|
| 1985 |
Mathur K, Salkin HM, Morito S. An efficient alorithm for the general multiple-choice knapsack problem (GMKP) Annals of Operations Research. 4: 253-283. DOI: 10.1007/Bf02022043 |
0.573 |
|
| 1984 |
Mathur K, Salkin HM, Nishimura K, Morito S. The Design of an Interactive Computer Software System for the Frequency-Assignment Problem Ieee Transactions On Electromagnetic Compatibility. 26: 207-212. DOI: 10.1109/Temc.1984.304223 |
0.452 |
|
| 1983 |
Mathur K, Salkin HM, Morito S. A branch and search algorithm for a class of nonlinear knapsack problems Operations Research Letters. 2: 155-160. DOI: 10.1016/0167-6377(83)90047-0 |
0.477 |
|
| 1981 |
Morito S, Salkin HM, Mathur K. Computational Experience with a Dual Backtrack Algorithm for Identifying Frequencies Likely to Create Intermodulation Problems Ieee Transactions On Electromagnetic Compatibility. 23: 32-36. DOI: 10.1109/Temc.1981.303918 |
0.393 |
|
| Show low-probability matches. |
