Sheldon Howard Jacobson,
Ph.D.
University
of Illinois at Urbana-Champaign
1.
Jacobson, S.H., Solow,
D., 1993, "The Effectiveness of Finite Improvement Algorithms for Finding
Global Optima,” Zeitschrift fur Operations Research (ZOR) -- Methods
and Models of Operations Research, 37(3), 257-272.
2.
Jacobson, S.H., Johnson,
A.W., Sullivan, K.A., Fleischer, M.A., Kumar, A., 1997, “Metaheuristics for a
Flexible Assembly System Design Problem,” Journal
of Heuristics, 3(2), 139-159.
3. Jacobson, S.H., Sullivan, K.A., Johnson,
A.W., 1998, "Discrete Manufacturing Process Design Optimization Using Computer
Simulation and Generalized Hill Climbing Algorithms," Engineering Optimization, 31, 247-260.
4.
Fleischer, M., Jacobson,
S.H., 1999, "Information Theory and the Finite-Time Behavior of the
Simulated Annealing Algorithm: Experimental Results," INFORMS Journal on Computing, 11(1), 35-43.
5.
Kumar, A., Jacobson,
S.H., Sewell, E.C., 2000, "Computational Analysis of a Flexible Assembly
System Design Problem," European
Journal of Operational Research, 123(3), 453-472.
6.
Sullivan, K.A. and
Jacobson, S.H., 2000, “Ordinal Hill Climbing Algorithms for Discrete
Manufacturing Process Design Optimization Problems,” Discrete Event Dynamical Systems, 10(4), 307-324.
7.
Vaughan, D., S.H.
Jacobson, and D. Armstrong, 2000, “A New Neighborhood Function for Discrete
Manufacturing Process Design Optimization Using Generalized Hill Climbing
Algorithms,” ASME Journal of Mechanical Design, 122(2), 164-171.
8.
Sullivan, K.A.,
Jacobson, S.H., 2001, "A Convergence Analysis of Generalized Hill Climbing
Algorithms," IEEE Transactions on Automatic Control, 46(8),
1288-1293.
9.
Johnson, A.W., Jacobson,
S.H., 2002, “A Class of Convergent Generalized Hill Climbing Algorithms,” Applied
Mathematics and Computation, 125(2-3), 359-373.
10. Johnson, A.W., Jacobson, S.H., 2002, “On the Convergence of Generalized
Hill Climbing Algorithms,” Discrete Applied Mathematics, 119(1-2),
37-57.
11. Orosz, J.E.,
Jacobson, S.H. 2002, “Finite-time Performance Analysis of Static Simulated
Annealing Algorithms,” Computational Optimization and Applications,
21(1), 21-53.
12. Orosz, J.E.,
Jacobson, S.H., 2002, “Analysis of Static Simulated Annealing Algorithms,"
Journal of Optimization Theory and Application, 115(1), 165-182.
13. Fleischer, M.A., Jacobson,
S.H., 2002, “Scale Invariance Properties in the Simulated Annealing Algorithm,”
Methodology and Computing In Applied Probability, 4(3), 219-241.
14. Henderson, D., Vaughan, D.E., Jacobson, S.H., Wakefield, R.R.,
Sewell, E.C., 2003, "Solving the Shortest Route Cut and Fill Problem Using
Simulated Annealing,” European Journal of Operational Research, 145(1),
72-84.
15. Armstrong, D.E., Jacobson, S.H., 2003 “Studying the Complexity
of Global Verification for NP-hard Discrete Optimization Problems,” Journal
of Global Optimization, 27(1), 83-96.
16. Jacobson, S.H., Yucesan, E., 2004,
"Global Optimization Performance Measures for Generalized Hill Climbing
Algorithms," Journal of Global Optimization, 29(2), 173-190.
17. Venkat, V., Jacobson, S.H., Stori, J.A.,
2004, “A Post-Optimality Analysis Algorithm for Multi-Objective
Optimization," Computational Optimization and Applications, 28(3),
357-372.
18. Armstrong, D.E., Jacobson, S.H., 2004, “Polynomial
Transformations and Data Independent Neighborhood Functions,” Discrete
Applied Mathematics, 143(1-3), 272-284.
19.
Vaughan, D.E., Jacobson,
S.H., 2004, "Formulating the Meta-Heuristic Tabu
Search in the Generalized Hill Climbing Framework," Methodology and
Computing in Applied Probability,
6(3), 343-354.
20. Jacobson, S.H., Yucesan, E., 2004,
"Analyzing the Performance of Generalized Hill Climbing Algorithms," Journal
of Heuristics, 10(4), 387-405.
21. Vaughan, D.E., Jacobson, S.H., Hall, S.N., McLay,
L.A., 2005, "Simultaneous Generalized Hill-Climbing Algorithms for
Addressing Sets of Discrete Optimization Problems," INFORMS Journal on Computing 17(4), 438-450.
22. Armstrong, D.E., Jacobson, S.H., 2005, “Data Independent
Neighborhood Functions and Strict Local Optima,” Discrete Applied
Mathematics, 146(3), 233-243
23. Jacobson, S.H., Hall, S.N., McLay, L.A.,
Orosz, J.E., 2005, “Performance Analysis of Cyclic
Simulated Annealing Algorithms,” Methodology and Computing in Applied Probability,
7(2), 183-201.
24. Jacobson, S.H., McLay, L.A., Hall,
S.N., Henderson, D., Vaughan, D.E., 2006, “Optimal Search Strategies Using
Simultaneous Generalized Hill Climbing Algorithms,” Mathematical and Computer Modelling, 43(9-10), 1061-1073.
25. Armstrong, D.E., Jacobson, S.H., 2006,
“Order Preserving Reductions and Polynomial Improving Paths,” Operations Research Letters, 34(1), 9-16.
26. Kaul, H.,
Jacobson, S.H., 2006, “Global Optima Results for the Kauffman NK Model,” Mathematical
Programming, 106, 319-338.
27. Armstrong, D.E., Jacobson, S.H., 2006, “Analyzing the Complexity
of Finding Good Neighborhood Functions for Local Search Algorithms,” Journal
of Global Optimization, 36(2),
219-236.
28. Kaul, H.,
Jacobson, S.H., 2007, “New Global Optima Results for the Kauffman NK Model: Handling
Dependency,” Mathematical Programming, 108(2-3),
475-494.
29. McLay, L.A.,
Jacobson, S.H., 2007, “Integer Knapsack Problems with Set-Up Weights,” Computational
Optimization and Applications,
37(1), 35-47.
30. McLay, L.A.,
Jacobson, S.H., 2007, “Algorithms for the Bounded Set-Up Knapsack Problem,” Discrete Optimization, 4(2), 206-212.
31. Vaughan, D.E., Jacobson, S.H., Kaul,
H., 2007, “Analyzing the Performance of Simultaneous Generalized Hill Climbing
Algorithms,” Computational Optimization and Applications, 37(1), 103-119.
32. Armstrong, D.E., Jacobson, S.H., 2008, “An Analysis of
Neighborhood Functions on Generic Solution Spaces,” European Journal of
Operational Research, 186(2), 529-541.
33. Kao, G., Jacobson, S.H., 2008, “Finding Preferred Subset of
Pareto Optimal Solutions,” Computational Optimization and Applications, 40(1), 73-95.
34.
Kao, G.K., Sewell, E.C.,
Jacobson, S.H., 2009, “A Branch, Bound, and Remember Algorithm for the 1|ri|Sti Scheduling Problem,”
Journal of Scheduling, 12(2), 163-175.
36.
Nikolaev, A.G., Jacobson, S.H., 2011, “Using Markov Chains to Analyze
the Effectiveness of Local Search Algorithms," Discrete Optimization, 8(2), 160-173.
37.
Nikolaev, A.G., Jacobson, S.H., Hall, S.N., Henderson, D., 2011, “A Framework for Analyzing Sub-Optimal
Performance of Local Search Algorithm", Computational Optimization and Applications, 49(3), 407-433
(Honorable Mention, Best Paper Award).
38.
Sewell, E.C., Jacobson,
S.H., Kaul, H., 2011, “Reductions for the Stable Set
Problem," Algorithmic Operations
Research, 6(1), 40-55.
39.
Kao, G.K., Sewell, E.C.,
Jacobson, S.H., Hall, S.N., 2012, “New Dominance Rules and Exploration Strategies
for the 1|ri|SUi Scheduling Problem,” Computational Optimization and Applications,
51(3), 1253-1274.
40.
Sewell, E.C., Jacobson,
S.H., 2012, “A Branch, Bound, and Remember Algorithm for the Simple Assembly
Line Balancing Problem, INFORMS Journal
on Computing, 24(3), 443-442.
41.
Sewell, E.C., Sauppe, J.J., Morrison, D.M., Jacobson, S.H., Kao, G.K.,
2012, “Minimizing Total Tardiness for the Single Machine with Sequence
Dependent Setup Time Problem Using the BB&R Algorithm,” Journal of Global Optimization, 54(4),
791-812 (Top-5 Papers (of 149) Published in Journal
of Global Optimization in 2012).
42.
Morrison, D.M., Sauppe, J.J., Jacobson, S.H., 2013, “A Network Simplex
Algorithm for the Equal Flow Problem on a Generalized Network,” INFORMS Journal on Computing, 25(1),
2-12.
43.
Morrison, D.M., Sauppe, J.J., Jacobson, S.H., 2014, “A Note on the
Proportional Network Flow Problem,” Optimization
Letters, 8(3), 801-809.
44.
Morrison, D.R., Sewell,
E.C., Jacobson, S.H., 2014, “A Computational Study of the Simple Assembly Line
Balancing Problem using Cyclic Best-First Search,” European Journal of Operational Research, 236(2), 403-409.
45.
Morrison, D.R., Sauppe, J.J., Sewell, E.C., Jacobson, S.H., “A Wide
Branching Strategy for the Graph Coloring Problem,” INFORMS Journal on Computing, 26(4), 704-717.
46. Morrison, D.R., Sewell, E.C., Jacobson, S.H., 2014,
“Characteristics of the
Maximal Independent Set ZDD,” Journal of
Combinatorial Optimization, 28(1), 121-139.
47. Morrison, D. R., Sewell, E.
C., Jacobson, S. H., 2016, “Solving the Pricing Problem in a Branch-and-Price
Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams,” INFORMS Journal on Computing, 27(1),
67-82.
48. Morrison,
D. R., Sauppe, J.J., Sewell, E.C., Jacobson, S.H.,
2016, "Branch-and-Bound Algorithms: A Survey of Recent Advances in
Searching, Branching, and Pruning," Discrete Optimization, 19, 79-102.
49. Morrison,
D.R., Sauppe, J.J., Zhang, W., Sewell, E.C.,
Jacobson, S.H., 2017, "Cyclic Best-First Search: Using Contours to Guide
Branch-and-Bound Algorithms," Naval Research Logistics.