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

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

1 2 3 ... 24 25 26 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. Perboli, Guido; Tadei, Roberto; Fadda, Edoardo: New valid inequalities for the two-echelon capacitated vehicle routing problem (2018)
  6. Strub, O.; Baumann, P.: Optimal construction and rebalancing of index-tracking portfolios (2018)
  7. Xu, Fengmin; Wang, Meihua; Dai, Yu-Hong; Xu, Dachuan: A sparse enhanced indexation model with chance and cardinality constraints (2018)
  8. Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay; Luedtke, James: Strengthened benders cuts for stochastic integer programs with continuous recourse (2017)
  9. Cabrera-Guerrero, Guillermo; Lagos, Carolina; Castañeda, Carolina; Johnson, Franklin; Paredes, Fernando; Cabrera, Enrique: Parameter tuning for local-search-based matheuristic methods (2017)
  10. Mencarelli, Luca; Sahraoui, Youcef; Liberti, Leo: A multiplicative weights update algorithm for MINLP (2017)
  11. Pan, Yunpeng; Liang, Zhe: Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (2017)
  12. Silva, Marcos Roberto; Cunha, Claudio B.: A tabu search heuristic for the uncapacitated single allocation $p$-hub maximal covering problem (2017)
  13. Tran, Trung Hieu; Scaparra, Maria Paola; O’Hanley, Jesse R.: A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (2017)
  14. Umetani, Shunji: Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (2017)
  15. Zhang, Mei; Wu, Kaihua; Hu, Yueming: Improved teaching-learning-based optimization algorithm for solving job shop scheduling problem (2017)
  16. Blanquero, Rafael; Carrizosa, Emilio; G.-Tóth, Boglárka; Nogales-Gómez, Amaya: $p$-facility Huff location problem on networks (2016)
  17. Boland, Natashia; Clement, Riley; Waterer, Hamish: A bucket indexed formulation for nonpreemptive single machine scheduling problems (2016)
  18. Bożejko, Wojciech; Gnatowski, Andrzej; Niżyński, Teodor; Wodecki, Mieczysław: Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem (2016)
  19. Braune, R.; Zäpfel, G.: Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (2016)
  20. Breunig, U.; Schmid, V.; Hartl, R.F.; Vidal, T.: A large neighbourhood based heuristic for two-echelon routing problems (2016)

1 2 3 ... 24 25 26 next