OR-Library

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

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

1 2 3 ... 25 26 27 next

  1. Belik, Ivan; Jornsten, Kurt: Critical objective function values in linear sum assignment problems (2018)
  2. Coco, Amadeu A.; Santos, Andréa Cynthia; Noronha, Thiago F.: Formulation and algorithms for the robust maximal covering location problem (2018)
  3. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  4. Glover, Fred; Lewis, Mark; Kochenberger, Gary: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (2018)
  5. Ljubić, Ivana; Moreno, Eduardo: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (2018)
  6. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)
  7. Ortiz-Astorquiza, Camilo; Contreras, Ivan; Laporte, Gilbert: Multi-level facility location problems (2018)
  8. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  9. Perboli, Guido; Tadei, Roberto; Fadda, Edoardo: New valid inequalities for the two-echelon capacitated vehicle routing problem (2018)
  10. Strub, O.; Baumann, P.: Optimal construction and rebalancing of index-tracking portfolios (2018)
  11. Xu, Fengmin; Wang, Meihua; Dai, Yu-Hong; Xu, Dachuan: A sparse enhanced indexation model with chance and cardinality constraints (2018)
  12. Albareda-Sambola, Maria; Landete, Mercedes; Monge, Juan F.; Sainz-Pardo, José L.: Introducing capacities in the location of unreliable facilities (2017)
  13. Bierwirth, C.; Kuhpfahl, J.: Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (2017)
  14. Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay; Luedtke, James: Strengthened benders cuts for stochastic integer programs with continuous recourse (2017)
  15. Bruni, Renato; Cesarone, Francesco; Scozzari, Andrea; Tardella, Fabio: On exact and approximate stochastic dominance strategies for portfolio selection (2017)
  16. Cabrera-Guerrero, Guillermo; Lagos, Carolina; Castañeda, Carolina; Johnson, Franklin; Paredes, Fernando; Cabrera, Enrique: Parameter tuning for local-search-based matheuristic methods (2017)
  17. Leitner, Markus; Ljubić, Ivana; Salazar-González, Juan-José; Sinnl, Markus: An algorithmic framework for the exact solution of tree-star problems (2017)
  18. Mencarelli, Luca; Sahraoui, Youcef; Liberti, Leo: A multiplicative weights update algorithm for MINLP (2017)
  19. Pan, Yunpeng; Liang, Zhe: Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (2017)
  20. Sayah, David; Irnich, Stefan: A new compact formulation for the discrete $p$-dispersion problem (2017)

1 2 3 ... 25 26 27 next