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

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

1 2 3 ... 29 30 31 next

  1. Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile: A robust (p)-center problem under pressure to locate shelters in wildfire context (2020)
  2. 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)
  3. Marín, Alfredo; Ponce, Diego; Puerto, Justo: A fresh view on the discrete ordered median problem based on partial monotonicity (2020)
  4. Park, Youngsoo; Nielsen, Peter; Moon, Ilkyeong: Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (2020)
  5. Peña-Ordieres, Alejandra; Luedtke, James R.; Wächter, Andreas: Solving chance-constrained problems via a smooth sample-based nonlinear approximation (2020)
  6. Pessoa, Artur; Sadykov, Ruslan; Uchoa, Eduardo; Vanderbeck, François: A generic exact solver for vehicle routing and related problems (2020)
  7. Setzer, Thomas; Blanc, Sebastian M.: Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (2020)
  8. Setzer, Thomas; Blanc, Sebastian M.: Corrigendum to: “Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems” (2020)
  9. Teng, Yue; Yang, Li; Song, Xiaoliang; Yu, Bo: An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (2020)
  10. Arulselvan, Ashwin; Bley, Andreas; Ljubić, Ivana: The incremental connected facility location problem (2019)
  11. Bezoui, Madani; Moulaï, Mustapha; Bounceur, Ahcène; Euler, Reinhardt: An iterative method for solving a bi-objective constrained portfolio optimization problem (2019)
  12. Bomze, Immanuel M.; Cheng, Jianqiang; Dickinson, Peter J. C.; Lisser, Abdel; Liu, Jia: Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (2019)
  13. Cordone, Roberto; Hosteins, Pierre: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (2019)
  14. Crawford, Broderick; Soto, Ricardo; Riquelme, Luis; Astorga, Gino; Johnson, Franklin; Cortés, Enrique; Castro, Carlos; Paredes, Fernando; Olivares, Rodrigo: A self-adaptive biogeography-based algorithm to solve the set covering problem (2019)
  15. Davari, Soheil: The incremental cooperative design of preventive healthcare networks (2019)
  16. Dias Saraiva, Rommel; Nepomuceno, Napoleão; Pinheiro, Plácido Rogério: A two-phase approach for single container loading with weakly heterogeneous boxes (2019)
  17. Filippi, Carlo; Ogryczak, Włodzimierz; Speranza, M. Grazia: Bridging (k)-sum and CVaR optimization in MILP (2019)
  18. Jabrayilov, Adalat; Mutzel, Petra: A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints (2019)
  19. López-Sánchez, A. D.; Sánchez-Oro, J.; Hernández-Díaz, A. G.: GRASP and VNS for solving the (p)-next center problem (2019)
  20. Masone, Adriano; Nenni, Maria Elena; Sforza, Antonio; Sterle, Claudio: The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (2019)

1 2 3 ... 29 30 31 next