Skip to main content

What algoritms does gurobi use and is there documentation?

Open

Comments

3 comments

  • Maliheh Aramon
    Gurobi Staff Gurobi Staff

    Hi Rick, 

    Gurobi solves mixed-integer programming (MIP) problems using a linear-programming based branch-and-cut algorithm. You can have a look at Mixed-Integer Programming (MIP) - A Primer on the Basics for an introductory discussion of the underlying algorithm used in Gurobi.

    To cite Gurobi in your thesis, you can follow the instructions at How do I cite Gurobi Software for an academic publication? article.

    Best regards,

    Maliheh

    0
  • rick van Willigen
    Gurobi-versary
    First Comment
    First Question

    Thank you very much!

    0
  • Saeed Abdolmaleki
    First Question
    Gurobi-versary
    First Comment

    Hi 

     

    could you elaborate more on algorithms that Gurobi hires for solving Quadratic constraint/Obj instances? I meant like, (e.g., what type of cutting planes does the package take into consideration?, Any sub modularity, PolyMatroid ..?)

    And, As I need to modify the solver for special cases, How can I enforce the solver to compare solutions among different strategies. Is there any modifiable attribute for such need?

    0

Please sign in to leave a comment.