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

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

1 2 3 ... 27 28 29 next

  1. Cordone, Roberto; Hosteins, Pierre: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (2019)
  2. 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)
  3. Filippi, Carlo; Ogryczak, Włodzimierz; Speranza, M. Grazia: Bridging (k)-sum and CVaR optimization in MILP (2019)
  4. Jabrayilov, Adalat; Mutzel, Petra: A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints (2019)
  5. 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)
  6. Olender, Paweł; Ogryczak, Włodzimierz: A revised variable neighborhood search for the discrete ordered median problem (2019)
  7. Strub, O.; Trautmann, N.: A two-stage approach to the UCITS-constrained index-tracking problem (2019)
  8. Xu, Fengmin; Dai, Yuhong; Zhao, Zhihu; Xu, Zongben: Efficient projected gradient methods for cardinality constrained optimization (2019)
  9. Akgün, İbrahim; Tansel, Barbaros Ç.: (p)-hub median problem for non-complete networks (2018)
  10. Ales, Zacharie; Elloumi, Sourour: Compact MILP formulations for the (p)-center problem (2018)
  11. Belik, Ivan; Jornsten, Kurt: Critical objective function values in linear sum assignment problems (2018)
  12. Chen, Xiaojun; Kelley, C. T.; Xu, Fengmin; Zhang, Zaikun: A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization (2018)
  13. Chupov, S. V.: An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem (2018)
  14. Coco, Amadeu A.; Santos, Andréa Cynthia; Noronha, Thiago F.: Formulation and algorithms for the robust maximal covering location problem (2018)
  15. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  16. Deng, Zhi-Bin; Tian, Ye; Lu, Cheng; Xing, Wen-Xun: Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (2018)
  17. Glover, Fred; Lewis, Mark; Kochenberger, Gary: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (2018)
  18. Goodrich, Timothy D.; Sullivan, Blair D.; Humble, Travis S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework (2018)
  19. Lemarchand, Laurent; Massé, Damien; Rebreyend, Pascal; Håkansson, Johan: Multiobjective optimization for multimode transportation problems (2018)
  20. Liagkouras, K.; Metaxiotis, K.: A new efficiently encoded multiobjective algorithm for the solution of the cardinality constrained portfolio optimization problem (2018)

1 2 3 ... 27 28 29 next