OR-Library is a collection of test data sets for a variety of Operations Research (OR) problems. These test data sets can be accessed via the WWW using the links below. OR-Library was originally described in J.E.Beasley, ”OR-Library: distributing test problems by electronic mail”, Journal of the Operational Research Society 41(11) (1990) pp1069-1072.

References in zbMATH (referenced in 450 articles , 1 standard article )

Showing results 1 to 20 of 450.
Sorted by year (citations)

1 2 3 ... 21 22 23 next

  1. Boland, Natashia; Clement, Riley; Waterer, Hamish: A bucket indexed formulation for nonpreemptive single machine scheduling problems (2016)
  2. Fampa, Marcia; Lee, Jon; Melo, Wendel: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in $n$-space (2016)
  3. Ogryczak, Włodzimierz; Olender, Paweł: Ordered median problem with demand distribution weights (2016)
  4. Saif, Ahmed; Elhedhli, Samir: A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (2016)
  5. Talbi, El-Ghazali: Combining metaheuristics with mathematical programming, constraint programming and machine learning (2016)
  6. Yoda, Kunikazu; Prékopa, András: Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (2016)
  7. Alvarez-Valdes, R.; Parreño, F.; Tamarit, J.M.: Lower bounds for three-dimensional multiple-bin-size bin packing problems (2015)
  8. Ananiashvili, Natela: Solution of problems of minimal set partition and set covering (2015)
  9. Basu, Sumanta; Sharma, Megha; Ghosh, Partha Sarathi: Metaheuristic applications on discrete facility location problems: a survey (2015)
  10. Bruni, Renato; Cesarone, Francesco; Scozzari, Andrea; Tardella, Fabio: A linear risk-return model for enhanced indexation in portfolio optimization (2015)
  11. Cesarone, Francesco; Scozzari, Andrea; Tardella, Fabio: Linear vs. quadratic portfolio selection models with hard real-world constraints (2015)
  12. Cheng, Jianqiang; Houda, Michal; Lisser, Abdel: Chance constrained $0-1$ quadratic programs using copulas (2015)
  13. Cheng, Jianqiang; Lisser, Abdel: Maximum probability shortest path problem (2015)
  14. de Queiroz, Thiago Alves; Miyazawa, Flávio Keidi; Wakabayashi, Yoshiko: On the $L$-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (2015)
  15. Doan, Xuan Vinh; Li, Xiaobo; Natarajan, Karthik: Robustness to dependency in portfolio optimization using overlapping marginals (2015)
  16. Fu, Zhang-Hua; Hao, Jin-Kao: Dynamic programming driven memetic search for the Steiner tree problem with revenues, budget, and hop constraints (2015)
  17. Gao, Chao; Yao, Xin; Weise, Thomas; Li, Jinlong: An efficient local search heuristic with row weighting for the unicost set covering problem (2015)
  18. Kukin, V.D.: The big valley conjecture for the flow Steiner tree problem (2015)
  19. Loreto, Milagros; Crema, Alejandro: Convergence analysis for the modified spectral projected subgradient method (2015)
  20. Monteiro, Marta S.R.; Fontes, Dalila B.M.M.; Fontes, Fernando A.C.C.: The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach (2015)

1 2 3 ... 21 22 23 next