Skip to content

Latest commit

 

History

History
20 lines (19 loc) · 4.44 KB

Operations-Research_OR.md

File metadata and controls

20 lines (19 loc) · 4.44 KB
Raw

OR (Operations Research)

  • Hu, J., Fu, M.C. and Marcus, S.I., 2007. A model reference adaptive search method for global optimization. Operations Research, 55(3), pp.549-568. [ www ] ( EDA | CEM | Continuous Optimization | Combinatorial Optimization )
  • Pu, S. and Garcia, A., 2018. A flocking-based approach for distributed stochastic optimization. Operations Research, 66(1), pp.267-281. [ www ]
  • Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N. and Rei, W., 2012. A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), pp.611-624. [ www ] ( GA )
  • Debels, D. and Vanhoucke, M., 2007. A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Operations Research, 55(3), pp.457-469. [ www ] ( GA | Combinatorial Optimization )
  • Ben Hadj-Alouane, A. and Bean, J.C., 1997. A genetic algorithm for the multiple-choice integer program. Operations Research, 45(1), pp.92-101. [ www ] ( GA )
  • Aggarwal, C.C., Orlin, J.B. and Tai, R.P., 1997. Optimized crossover for the independent set problem. Operations Research, 45(2), pp.226-234. [ www ] ( GA )
  • Fu, Z., Golden, B., Lele, S., Raghavan, S. and Wasil, E., 2003. Genetically engineered decision trees: population diversity produces smarter trees. Operations Research, 51(6), pp.894-907. [www] (GA)
  • Blazewicz, J., Oguz, C., Swiercz, A. and Weglarz, J., 2006. DNA sequencing by hybridization via genetic search. Operations Research, 54(6), pp.1185-1192. [www]
  • Anderson, E.J. and Cau, T.D.H., 2009. Modeling implicit collusion using coevolution. Operations Research, 57(2), pp.439-455. [www] (GA)
  • Van Laarhoven, P.J., Aarts, E.H. and Lenstra, J.K., 1992. Job shop scheduling by simulated annealing. Operations Research, 40(1), pp.113-125. [ www ] ( SA )
  • Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C., 1991. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3), pp.378-406. [ www ] ( SA )
  • Johnson, D.S., Aragon, C.R., McGeoch, L.A. and Schevon, C., 1989. Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning. Operations Research, 37(6), pp.865-892. [ www ] ( SA )
  • Anily, S. and Federgruen, A., 1987. Ergodicity in parametric nonstationary Markov chains: An application to simulated annealing methods. Operations Research, 35(6), pp.867-874. [ www ] ( SA )
  • Pincus, M., 1970. A Monte Carlo method for the approximate solution of certain types of constrained optimization problems. Operations Research, 18(6), pp.1225-1228. [ www ]
  • Brooks, S.H., 1958. A discussion of random methods for seeking maxima. Operations Research, 6(2), pp.244-251. [ www ] ( RS | Continuous Optimization )
  • Gendreau, M., Laporte, G. and Séguin, R., 1996. A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers. Operations Research, 44(3), pp.469-477. [ www ] ( tabu )
  • Hertz, A., Laporte, G. and Mittaz, M., 2000. A Tabu Search Heuristic for the Capacitated arc Routing Problem. Operations Research, 48(1), pp.129-135. [ www ] ( tabu )
  • Rothlauf F. On optimal solutions for the optimal communication spanning tree problem[J]. Operations Research, 2009, 57(2): 413-425. [ www ] ( SA | GA )