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

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

1 2 3 ... 23 24 25 next

  1. Bodur, Merve; Dash, Sanjeeb; Günlük, Oktay; Luedtke, James: Strengthened benders cuts for stochastic integer programs with continuous recourse (2017)
  2. Mencarelli, Luca; Sahraoui, Youcef; Liberti, Leo: A multiplicative weights update algorithm for MINLP (2017)
  3. Pan, Yunpeng; Liang, Zhe: Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (2017)
  4. Silva, Marcos Roberto; Cunha, Claudio B.: A tabu search heuristic for the uncapacitated single allocation $p$-hub maximal covering problem (2017)
  5. Zhang, Mei; Wu, Kaihua; Hu, Yueming: Improved teaching-learning-based optimization algorithm for solving job shop scheduling problem (2017)
  6. Blanquero, Rafael; Carrizosa, Emilio; G.-Tóth, Boglárka; Nogales-Gómez, Amaya: $p$-facility Huff location problem on networks (2016)
  7. Boland, Natashia; Clement, Riley; Waterer, Hamish: A bucket indexed formulation for nonpreemptive single machine scheduling problems (2016)
  8. 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)
  9. Braune, R.; Zäpfel, G.: Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics (2016)
  10. Breunig, U.; Schmid, V.; Hartl, R.F.; Vidal, T.: A large neighbourhood based heuristic for two-echelon routing problems (2016)
  11. Carling, Kenneth; Meng, Xiangli: On statistical bounds of heuristic solutions to location problems (2016)
  12. Cheng, Jianqiang; Leung, Janny; Lisser, Abdel: New reformulations of distributionally robust shortest path problem (2016)
  13. Colmenar, J.Manuel; Greistorfer, Peter; Martí, Rafael; Duarte, Abraham: Advanced greedy randomized adaptive search procedure for the obnoxious $p$-median problem (2016)
  14. Delorme, Maxence; Iori, Manuel; Martello, Silvano: Bin packing and cutting stock problems: mathematical models and exact algorithms (2016)
  15. Drezner, Zvi; Marianov, Vladimir; Wesolowsky, George O.: Maximizing the minimum cover probability by emergency facilities (2016)
  16. Fampa, Marcia; Lee, Jon; Melo, Wendel: A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in $n$-space (2016)
  17. Ferjani, Ayet Allah; Liouane, Noureddine; Borne, Pierre: Logic gate-based evolutionary algorithm for the multidimensional knapsack problem-wireless sensor network application (2016)
  18. Furini, Fabio; Malaguti, Enrico; Thomopulos, Dimitri: Modeling two-dimensional guillotine cutting problems via integer programming (2016)
  19. Kuhpfahl, J.; Bierwirth, C.: A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective (2016)
  20. Liu, Shi Qiang; Kozan, Erhan: Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (2016)

1 2 3 ... 23 24 25 next