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 636 articles , 1 standard article )

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

1 2 3 ... 30 31 32 next

  1. Aboolian, Robert; Berman, Oded; Krass, Dmitry: Optimizing facility location and design (2021)
  2. Bahiense, Laura; Besso, Arthur; Tostas, Rogerio; Maculan, Nelson: Using multiflow formulations to solve the Steiner tree problem in graphs (2021)
  3. Chang, Jian; Wang, Lifang; Hao, Jin-Kao; Wang, Yang: Parallel iterative solution-based Tabu search for the obnoxious (p)-median problem (2021)
  4. de Weerdt, Mathijs; Baart, Robert; He, Lei: Single-machine scheduling with release times, deadlines, setup times, and rejection (2021)
  5. Iori, Manuel; de Lima, Vinícius L.; Martello, Silvano; Miyazawa, Flávio K.; Monaci, Michele: Exact solution techniques for two-dimensional cutting and packing (2021)
  6. Kaliszewski, I.; Miroforidis, J.: Cooperative multiobjective optimization with bounds on objective functions (2021)
  7. Marín, Alfredo; Pelegrín, Mercedes: The double-assignment plant location problem with co-location (2021)
  8. Nguyen, Viet Hung; Minoux, Michel: Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (2021)
  9. Rostami, Borzou; Kämmerling, Nicolas; Naoum-Sawaya, Joe; Buchheim, Christoph; Clausen, Uwe: Stochastic single-allocation hub location (2021)
  10. Touati, Sofiane; Radjef, Mohammed Said; Sais, Lakhdar: A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (2021)
  11. Vitor, Fabio; Easton, Todd: Approximate and exact merging of knapsack constraints with cover inequalities (2021)
  12. Zhou, Guo; Zhou, Yongquan; Zhao, Ruxin: Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (2021)
  13. Church, Richard L.; Wang, Shaohua: Solving the (p)-median problem on regular and lattice networks (2020)
  14. Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile: A robust (p)-center problem under pressure to locate shelters in wildfire context (2020)
  15. Dunbar, Michelle; Belieres, Simon; Shukla, Nagesh; Amirghasemi, Mehrdad; Perez, Pascal; Mishra, Nishikant: A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network (2020)
  16. Lanza-Gutierrez, Jose M.; Caballe, N. C.; Crawford, Broderick; Soto, Ricardo; Gomez-Pulido, Juan A.; Paredes, Fernando: Exploring further advantages in an alternative formulation for the set covering problem (2020)
  17. Marín, Alfredo; Ponce, Diego; Puerto, Justo: A fresh view on the discrete ordered median problem based on partial monotonicity (2020)
  18. Monge, Juan F.: Equally weighted cardinality constrained portfolio selection via factor models (2020)
  19. Park, Youngsoo; Nielsen, Peter; Moon, Ilkyeong: Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (2020)
  20. Peña-Ordieres, Alejandra; Luedtke, James R.; Wächter, Andreas: Solving chance-constrained problems via a smooth sample-based nonlinear approximation (2020)

1 2 3 ... 30 31 32 next