• MIPLIB

  • Referenced in 292 articles [sw04067]
  • mixed integer (linear) program (mip) is an optimization problem in which a linear objective function ... diverse collection of challenging real-world mip instances from various academic and industrial applications suited ... benchmarking and testing of mip solution algorithms...
  • SCIP

  • Referenced in 429 articles [sw01091]
  • commercial solvers for mixed integer programming (MIP) and mixed integer nonlinear programming (MINLP...
  • OCaml

  • Referenced in 271 articles [sw06363]
  • processor architectures (IA32, PowerPC, AMD64, Alpha, Sparc, Mips, IA64, HPPA, StrongArm), as well...
  • FEASPUMP

  • Referenced in 122 articles [sw04802]
  • solution of a given mixed-integer programming (MIP) model is a very important 𝒩𝒫-complete ... finding a feasible solution to general MIPs that can be viewed as a clever ... computational results on binary and general integer MIPs from the literature show that...
  • KNITRO

  • Referenced in 169 articles [sw00490]
  • MPCCs or MPECs), and mixed-integer programming (MIPs), particular convex mixed integer, nonlinear problems (MINLP...
  • GLPK

  • Referenced in 164 articles [sw04560]
  • scale linear programming (LP), mixed integer programming (MIP), and other related problems...
  • AlphaECP

  • Referenced in 45 articles [sw04940]
  • method requires only the solution of a MIP sub problem in each iteration ... MIP sub problems may be solved to optimality, but can also be solved to feasibility...
  • DICOPT

  • Referenced in 34 articles [sw04938]
  • DICOPT solves a series of NLP and MIP sub-problems. These sub-problems ... solved using any NLP (Nonlinear Programming) or MIP (Mixed-Integer Programming) solver that runs under...
  • ParaSCIP

  • Referenced in 28 articles [sw06292]
  • Parallel Extension of SCIP. Mixed integer programming (MIP)has become one of the most important ... currently one of the fastest non-commercial MIP solvers. It is based on the branchandboundprocedure ... MIPLIB2003, a standard test set library for MIP solvers. For these computations, we used...
  • Zimpl

  • Referenced in 32 articles [sw04064]
  • hopefully) solved by a LP or MIP solver...
  • SUIF

  • Referenced in 27 articles [sw08807]
  • level parallelism and locality optimizer, an optimizing MIPS back end, a set of compiler development...
  • UG

  • Referenced in 22 articles [sw03500]
  • parallelize branch-and-bound based solvers (e.g., MIP, MINLP, ExactIP) in a distributed or shared...
  • LogMIP

  • Referenced in 22 articles [sw05035]
  • stage of maturity and reliability as LP, MIP and NLP modeling, these problems have...
  • BaPCod

  • Referenced in 13 articles [sw09871]
  • prototype code that solves Mixed Integer Programs (MIP) by application of a Dantzig-Wolfe reformulation ... constraints and variables of the MIP in its natural/ compact formulation; the user specifies which ... implemented that relies on an underlying MIP solver to handle master and subproblem...
  • MOPS

  • Referenced in 20 articles [sw08791]
  • This paper discusses only LP optimization. The MIP optimizer in MOPS is a prototype version...
  • DINS

  • Referenced in 8 articles [sw10145]
  • DINS, a MIP improvement heuristic. We introduce Distance Induced Neighbourhood Search (DINS), a MIP improvement ... heuristic that tries to find improved MIP feasible solutions from a given MIP feasible solution ... search that is embedded in an exact MIP solver, namely a branch-and-bound ... branch-and-cut MIP solver. The key idea is to use a distancemetric between...
  • QEMU

  • Referenced in 17 articles [sw31057]
  • hosts (x86, PowerPC, ARM, Sparc, Alpha and MIPS). QEMU supports full system emulation in which...
  • ISAAP

  • Referenced in 10 articles [sw07468]
  • Linear Programming (LP) or Mixed Integer Programming (MIP) problems. The MCMA has been used ... applicable also to large LP and MIP problems. Other implementations of the same methodology have...
  • SCIP-Jack

  • Referenced in 12 articles [sw18748]
  • using a state-of-the-art MIP-framework. The result is a high-performance solver...