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

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

1 2 3 ... 26 27 28 next

  1. Akgün, İbrahim; Tansel, Barbaros Ç.: $p$-hub median problem for non-complete networks (2018)
  2. Ales, Zacharie; Elloumi, Sourour: Compact MILP formulations for the $p$-Center problem (2018)
  3. Belik, Ivan; Jornsten, Kurt: Critical objective function values in linear sum assignment problems (2018)
  4. Chen, Xiaojun; Kelley, C. T.; Xu, Fengmin; Zhang, Zaikun: A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization (2018)
  5. Coco, Amadeu A.; Santos, Andréa Cynthia; Noronha, Thiago F.: Formulation and algorithms for the robust maximal covering location problem (2018)
  6. Delorme, Maxence; Iori, Manuel; Martello, Silvano: BPPLIB: a library for bin packing and cutting stock problems (2018)
  7. Glover, Fred; Lewis, Mark; Kochenberger, Gary: Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (2018)
  8. Goodrich, Timothy D.; Sullivan, Blair D.; Humble, Travis S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework (2018)
  9. Lemarchand, Laurent; Massé, Damien; Rebreyend, Pascal; Håkansson, Johan: Multiobjective optimization for multimode transportation problems (2018)
  10. Ljubić, Ivana; Moreno, Eduardo: Outer approximation and submodular cuts for maximum capture facility location problems with random utilities (2018)
  11. López, C. O.; Beasley, J. E.: Packing unequal rectangles and squares in a fixed size circular container using formulation space search (2018)
  12. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)
  13. Mutunge, Purity; Haugland, Dag: Minimizing the tracking error of cardinality constrained portfolios (2018)
  14. Ortiz-Astorquiza, Camilo; Contreras, Ivan; Laporte, Gilbert: Multi-level facility location problems (2018)
  15. Pajor, Thomas; Uchoa, Eduardo; Werneck, Renato F.: A robust and scalable algorithm for the Steiner problem in graphs (2018)
  16. Perboli, Guido; Tadei, Roberto; Fadda, Edoardo: New valid inequalities for the two-echelon capacitated vehicle routing problem (2018)
  17. Strub, O.; Baumann, P.: Optimal construction and rebalancing of index-tracking portfolios (2018)
  18. Umetani, Shunji; Arakawa, Masanao; Yagiura, Mutsunori: Relaxation heuristics for the set multicover problem with generalized upper bound constraints (2018)
  19. Xu, Fengmin; Wang, Meihua; Dai, Yu-Hong; Xu, Dachuan: A sparse enhanced indexation model with chance and cardinality constraints (2018)
  20. Yıldız, Barış; Karaşan, Oya Ekin; Yaman, Hande: Branch-and-price approaches for the network design problem with relays (2018)

1 2 3 ... 26 27 28 next