• BaPCod

  • Referenced in 19 articles [sw09871]
  • reformulated problem is solved using a branch-and-price (column generation) algorithm. The specificity ... test different decompositions); the reformulation is automatically generated by the code, without any input from ... define master columns, their reduced cost, pricing problem, or Lagrangian bound; a default column generation...
  • libMC

  • Referenced in 47 articles [sw06615]
  • been succeeded by MC++. For the automatic generation of convex and concave relaxations ... first employed to develop an equivalent reformulation in terms of unary and binary operations ... forward mode or the reverse mode of automatic differentiation. In the forward mode, with each ... adequate for many small- to medium-size problems, especially those where the relaxation calculation does...
  • pyMDO

  • Referenced in 16 articles [sw07561]
  • reformulation when solving a given problem using different MDO methods: once a problem has been ... described, it can automatically be cast into any method. In addition, the modular design ... development and benchmarking of new methods. Results generated from this study provide a strong foundation...
  • GCG

  • Referenced in 23 articles [sw10533]
  • structure either provided by the user or automatically detected by one of the structure detectors ... holding the original problem, the other one representing the reformulated problem. The original instance coordinates ... original problem and solves the LP relaxation of the extended formulation via column generation...
  • OREX-J

  • Referenced in 1 article [sw07410]
  • limited to a specific class of optimization problems and algorithms. The purpose of the framework ... data can include algorithm parameters, test instance generator settings, the instances themselves, run-times, algorithm ... logs, solution properties, etc. All data are automatically saved in a relational database (MySQL ... experiments in three different areas: Algorithms and reformulations for mixed-integer programming models for dynamic...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

  • Referenced in 3164 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • KNITRO

  • Referenced in 196 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 306 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1701 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Maple

  • Referenced in 5369 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 6343 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13488 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MiniSat

  • Referenced in 566 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • nauty

  • Referenced in 609 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...
  • Paramils

  • Referenced in 87 articles [sw00678]
  • Paramils: an automatic algorithm configuration framework. The identification...
  • PSPLIB

  • Referenced in 269 articles [sw00740]
  • PSPLIB -- a project scheduling problem library. We present...
  • QAPLIB

  • Referenced in 233 articles [sw00751]
  • A collection of electronically available data instances for...
  • TSPLIB

  • Referenced in 697 articles [sw00983]
  • TSPLIB is a library of sample instances for...