Publications

Refereed Journal Publications (Updated 3/24/12)

  1. Prince, M., Smith, J.C., and Geunes, J., “Designing Fair 8- and 16-team Knockout Tournaments,” to appear in IMA Journal of Management Mathematics.
  2. Shen, S. and Smith, J.C., “A Decomposition Algorithm for Solving a Broadcast Domination Network Design Problem,” to appear in Annals of Operations Research.
  3. Shen, S. and Smith, J.C., “Polynomial-Time Algorithms for Disconnecting Trees and Series-Parallel Graphs under Component Connectivity Metrics,” to appear in Networks.
  4. Tighe, P.J., Smith, J.C., Boezaart, A.P., and Lucas, S.D., “Social Network Analysis and Quantification of a Prototypical Regional Anesthesia and Perioperative Pain Medicine Service,” to appear in Pain Medicine.
  5. Taskın, Z.C., Smith, J.C., and Romeijn, H.E. “Mixed-Integer Programming Techniques for Decomposing IMRT Fluence Maps Using Rectangular Apertures,” to appear in Annals of Operations Research.
  6. Penuel, J., Smith, J.C., and Shen, S., “Integer Programming Models and Algorithms for the Graph Decontamination Problem with Mobile Agents,” to appear in Networks.
  7. Sherali, H.D. and Smith, J.C., “Dynamic Lagrangian Dual and Reduced RLT Constructs for Solving 0-1 Mixed-Integer Programs,” TOP, 20(1), 173-189, 2012.
  8. Smith, J.C., Ulusal, E., and Hicks, I.V., “A Combinatorial Optimization Algorithm for Solving the Branchwidth Problem,” Computational Optimization and Applications, 51(3), 1211-1229, 2012.
  9. Behdani, B., Yun, Y., Smith, J.C., and Xia, Y., “Decomposition Algorithms for Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sinks,” Computers and Operations Research, 39(5), 1054-1061, 2012.
  10. Sherali, H.D. and Smith, J.C., “Higher-Level RLT or Disjunctive Cuts Based on a Partial Enumeration Strategy for 0-1 Mixed-Integer Programs,” Optimization Letters, 6(1), 127-139, 2012.
  11. Hemmati, M. and Smith, J.C., “Finite Optimal Stopping Problems:  The Seller’s Perspective,” Journal of Problem Solving, 3(2), 72-95, 2011.
  12. Shen, S., Smith, J.C., and Ahmed, S., “Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths,” Management Science, 56(10), 1794-1814, 2010.
  13. Hartman, J.C., Büyüktahtakın, İ.E., and Smith, J.C., “Dynamic Programming Based Inequalities for the Capacitated Lot-Sizing Problem,” IIE Transactions, 42(12), 915-930, 2010.
  14. Penuel, J., Smith, J.C., and Yuan, Y., “An Integer Decomposition Algorithm for Solving a Two-Stage Facility Location Problem with Second-Stage Activation Costs,” Naval Research Logistics, 57(5), 391-402, 2010.
  15. Taskın, Z.C., Smith, J.C., Romeijn, H.E., and Dempsey, J.F., “Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning,” Operations Research, 58(3), 674-690, 2010.
  16. Smith, J.C., Lim, C., and Alptekinoglu, A., “Optimal Mixed-Integer Programming and Heuristic Methods for a Bilevel Stackelberg Product Introduction Game,” Naval Research Logistics, 56(8), 714-729, 2009.
  17. Taskın, Z.C., Smith, J.C., Ahmed, S., and Schaefer, A.J., “Cutting Plane Algorithms for Solving a Robust Edge-Partition Problem,” Discrete Optimization, 6, 420-435, 2009.
  18. Henderson, D. and Smith, J.C., “An Exact Reformulation-Linearization Technique Algorithm for Solving a Parameter Extraction Problem Arising in Compact Thermal Models,” Optimization Methods and Software, 24(4-5), 857-870, 2009.
  19. Mofya, E.C. and Smith, J.C., “A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures,” INFORMS Journal on Computing, 21(2), 322-332, 2009.
  20. Smith, J.C., “Organization of the NCAA Baseball Tournament,” IMA Journal of Management Mathematics, 20(2), 213-232, 2009.
  21. Sherali, H.D. and Smith, J.C., “Two-Stage Stochastic Risk Threshold and Hierarchical Multiple Risk Problems:  Models and Algorithms,” Mathematical Programming, Series A, 120(2), 403-427, 2009.
  22. Smith, J.C., Henderson, D., Ortega, A., and DeVoe, J., “A Parameter Optimization Heuristic for a Temperature Estimation Model,” Optimization and Engineering, 10(1), 19-42, 2009.
  23. Andreas, A.K. and Smith, J.C., “Decomposition Algorithms for the Design of a Non-simultaneous Capacitated Evacuation Tree Network,” Networks, 53(2), 91-103, 2009.
  24. Lopes, L., Aronson, M., Carstensen, G., and Smith, J.C., “Optimization Support for Senior Design Project Assignments,” Interfaces, 38(6), 448-464, 2008.
  25. Andreas, A.K. and Smith, J.C., “Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Constraints,” INFORMS Journal on Computing, 20(4), 553-564, 2008.
  26. Andreas, A.K., Smith, J.C., and Küçükyavuz, S., “A Branch-and-Price-and-Cut Algorithm for Solving the Reliable h-paths Problem,” Journal of Global Optimization, 42(4), 443-466, 2008.
  27. Garg, M. and Smith, J.C., “Models and Algorithms for the Design of Survivable Networks with General Failure Scenarios,” Omega, 36(6), 1057-1071, 2008.
  28. Ragle, M.A., Smith, J.C., and Pardalos, P.M., “An Optimal Cutting-Plane Algorithm for Solving the Non-Unique Probe Selection Problem,” Annals of Biomedical Engineering, 35(11), 2023-2030, 2007.
  29. Smith, C.M., Smith, J.C., Williams, S.K., Rodriguez, J.J., and Hoying, J.B. “Accurate Volumetric Measurements of Vasculature Using Confocal Microscopy and Image Processing,” Journal of Microscopy, 225(3), 244-257, 2007.
  30. Smith, J.C., Lim, C., and Sudargho, F., “Survivable Network Design Under Optimal and Heuristic Interdiction Scenarios,” Journal of Global Optimization, 38(2), 181-199, 2007.
  31. Smith, J.C., Lim, C., and Bearden, J.N., “On the Multi-attribute Stopping Problem with General Value Functions,”  Operations Research Letters, 35(3), 324-330, 2007.
  32. Sherali, H.D. and Smith, J.C., “An Improved Linearization Strategy for Zero-One Quadratic Programming Problems,” Optimization Letters, 1(1), 33-47, 2007.
  33. Lim, C. and Smith, J.C., “Algorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems,” IIE Transactions, 39(1), 15-26, 2007.
  34. Armbruster, B., Smith, J.C., and Park, K., “The Optimization of Packet Filter Placements to Combat Distributed Denial of Service Attacks,” European Journal of Operational Research, 176(2), 1283-1292, 2007.
  35. Mofya, E.C. and Smith, J.C., “Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem,” Journal of Combinatorial Optimization, 12 (3), 231-256, 2006.
  36. Smith, J.C., Fraticelli, B.M.P, and Rainwater, C., “A Bracket Assignment Problem for the NCAA Men’s Basketball Tournament,” International Transactions in Operational Research, 13 (3), 253-271, 2006.
  37. Sherali, H.D. and Smith, J.C., “A Polyhedral Study of the Generalized Vertex Packing Problem,” Mathematical Programming, Series A, 107 (3), 367-390, 2006.
  38. Lim, C., Bearden, J.N., and Smith, J.C., “Sequential Search with Multi-Attribute Options,” Decision Analysis, 3 (1), 3-15, 2006.
  39. Sherali, H.D. and Smith, J.C., “Interleaving Two-Phased Jobs on a Single Machine with Application to Radar Pulse Interleaving,” Discrete Optimization, 2 (4), 348-361, 2005.
  40. Horne, J.A. and Smith, J.C., “Dynamic Programming Algorithms for the Conditional Covering Problem on Path and Extended Star Graphs,” Networks, 46 (4), 177-185, 2005.
  41. Horne, J.A. and Smith, J.C., “A Dynamic Programming Algorithm for the Conditional Covering Problem on Tree Graphs,” Networks, 46 (4), 186-197, 2005.
  42. Sherali, H.D. and Smith, J.C., “A Class of Web-Based Facets for the Generalized Vertex Packing Problem,” Discrete Applied Mathematics, 146 (3), 273-286, 2005.
  43. Lunday, B.J., Smith, J.C., and Goldberg, J.B., “Algorithms for Solving the Conditional Covering Problem on Paths,” Naval Research Logistics, 52 (4), 293-301, 2005.
  44. Smith, J.C. and Jacobson, S.H., “An Analysis of the Alias Method for Discrete Random-Variate Generation,” INFORMS Journal on Computing, 17 (3), 321-327, 2005.
  45. Mofya, E.C. and Smith, J.C., “The Optimal Deployment of Filters to Limit Forged Address Attacks in Communication Networks,” Lecture Notes on Computer Science, (3073), 239-251, 2004.
  46. Smith, J.C., Schaefer, A., and Yen, J., “A Stochastic Integer Programming Approach to Solving a Synchronous Optical Network Ring Design Problem,” Networks, 44 (1), 12-26, 2004.
  47. Elshafei, M., Sherali, H.D., and Smith, J.C., “Radar Pulse Interleaving for Multi-Target Tracking,” Naval Research Logistics, 51 (1), 72-94, 2004.
  48. Smith, J.C., “Algorithms for Distributing Telecommunication Traffic on a Multiple-Ring SONET-Based Network,” European Journal of Operational Research, 154 (3), 659-672, 2004.
  49. Baker, K. and Smith, J.C., “A Multiple-Criterion Model for Machine Scheduling,” Journal of Scheduling, 6, 7-16, 2003.
  50. Smith, J.C., “A Genetic Algorithm Approach to Solving a Multiple Inventory Loading Problem,” International Journal of Industrial Engineering, 10 (1), 7-16, 2003.
  51. Sherali, H.D., Smith, J.C., and Trani, A.A., “An Airspace Planning Model for Selecting Flight-Plans Under Workload, Safety, and Equity Considerations,” Transportation Science, 36 (4), 378-397, 2002.
  52. Sherali, H.D. and Smith, J.C., “Improving Zero-One Model Representations Via Symmetry Considerations,” Management Science, 47 (10), 1396-1407, 2001.
  53. Sherali, H.D., Smith, J.C., and Selim, S.Z., “Convex Hull Representations of Models for Computing Collisions Between Multiple Bodies,” European Journal of Operational Research, 135 (3), 514-526, 2001.
  54. Sherali, H.D., Smith, J.C., Trani, A.A., and Sale, S., “National Airspace Sector Occupancy and Conflict Analysis Models for Evaluating Scenarios Under the Free-Flight Paradigm,” Transportation Science, 34, 321-336, 2000.
  55. Sherali, H.D., Smith, J.C., and Lee, Y., “Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting,” INFORMS Journal on Computing, 12 (4), 284-298, 2000.
  56. Sherali, H.D., Smith, J.C., and Adams, W.P., “Reduced First-Level Representations Via the Reformulation-Linearization Technique:  Results, Counter-Examples, and Computations,” Discrete Applied Mathematics, 101 (1), 247-267, 2000.

 

Papers submitted for publication

  1. Behdani, B. and Smith, J.C., “An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem,” submitted to INFORMS Journal on Computing.
  2. Shen, S., Smith, J.C., and Goli, R., “Exact Interdiction Models and Algorithms for Disconnecting Networks via Node Deletions,” revision under review for Discrete Optimization.
  3. Sullivan, K.M., Morton, D.P., Pan, F., and Smith, J.C., “Interdicting Stochastic Evasion Paths with Asymmetric Information on Bipartite Networks,” under revision for Naval Research Logistics.
  4. Yun, Y., Xia, Y., Behdani, B., and Smith, J.C., “Distributed Algorithm for Lifetime Maximization in Delay-Tolerant Wireless Sensor Network with Mobile Sink,” revision submitted to IEEE Transactions on Mobile Computing.
  5. Sullivan, K.M., Smith, J.C., and Morton, D.P., “Convex Hull Representation of the Deterministic Bipartite Network Interdiction Problem,” submitted to Mathematical Programming.
  6. Sonuc, S.B., Smith, J.C., and Hicks, I.V., “A Branch-and-Price-and-Cut Method for Computing an Optimal Bramble,” submitted to European Journal of Operational Research.
  7. Behdani, B., Smith, J.C., and Xia, Y., “The Lifetime Maximization Problem in Wireless Sensor Networks with a Mobile Sink: MIP Formulations and Algorithms,” submitted to IIE Transactions.
  8. Prince, M., Smith, J.C., and Geunes, J., “Optimizing Exclusivity Agreements in a Three-Stage Procurement Game,” submitted.
  9. Hemmati, M. and Smith, J.C., “A Mixed-Integer Bilevel Programming Approach for a Competitive Prioritized Set Covering Problem,” submitted to Discrete Optimization.

 

 

 


RSS