# \[AMPL 24621\] information about branch and bound with Gurobi in AMPL

**URL:** <https://discuss.ampl.com/t/ampl-24621-information-about-branch-and-bound-with-gurobi-in-ampl/516>\
**Category:** Google Group Mirror\
**Created:** [April 24, 2023, 8:20am UTC](https://discuss.ampl.com/t/ampl-24621-information-about-branch-and-bound-with-gurobi-in-ampl/516 "2023-04-24T08:20:02Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![Alessandro\_Rosati](https://avatars.discourse-cdn.com/v4/letter/a/e9a140/32.png) [@Alessandro\_Rosati](https://discuss.ampl.com/u/Alessandro_Rosati)\
**Post date:** [April 24, 2023, 8:20am UTC](https://discuss.ampl.com/t/ampl-24621-information-about-branch-and-bound-with-gurobi-in-ampl/516/1 "2023-04-24T08:20:02Z")

</div>

Where i find the information about branch and bound in AMPL with solver Gurobi. In particulare these informations are : maximum cardinality Clique, dual bound release continuous , number of nodes branch and bound,

number of simplex iterations Time total of execution

---

<div class="post-metadata">

**Author:** ![AMPL\_Google\_Group](https://avatars.discourse-cdn.com/v4/letter/a/9dc877/32.png) [@AMPL\_Google\_Group](https://discuss.ampl.com/u/AMPL_Google_Group)\
**Post date:** [April 25, 2023, 6:37pm UTC](https://discuss.ampl.com/t/ampl-24621-information-about-branch-and-bound-with-gurobi-in-ampl/516/2 "2023-04-25T18:37:03Z")

</div>

For an introduction to mixed-integer programming and branch-and-bound using Gurobi, see [https://www.gurobi.com/resources/mixed-integer-programming-mip-a-primer-on-the-basics/](https://www.gurobi.com/resources/mixed-integer-programming-mip-a-primer-on-the-basics/). Concerning particular terms you mentioned, here are some definitions:

Maximum cardinality clique: See [https://en.wikipedia.org/wiki/Clique\_problem](https://en.wikipedia.org/wiki/Clique_problem).

“dual bound release continuous”: It’s not clear what you mean by this.

Number of nodes: Number of subproblems in the branch-and-bound search tree that have been explored by Gurobi’s algorithm.

Number of simplex iterations: Total number of iterations of the simplex method that were needed to solve all subproblems in the search tree.

Total time of execution: Elapsed time for Gurobi’s entire run; the clock time when Gurobi finished, minus the clock time when Gurobi started.