Skip to main content

What algoritms does gurobi use and is there documentation?

Open

Comments

4 comments

  • Official comment
    Simranjit Kaur
    • Gurobi Staff
    This post is more than two years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum, or try Gurobot, our chatbot interface offering instant, expert-level support.
  • Maliheh Aramon
    • 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
    • Gurobi-versary
    • Investigator
    • Conversationalist

    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

Post is closed for comments.