Gurobi
GUROBI OPTIMIZER: State of the Art Mathematical Programming Solver. The Gurobi Optimizer is a state-of-the-art solver for mathematical programming. It includes the following solvers: linear programming solver (LP), quadratic programming solver (QP), quadratically constrained programming solver (QCP), mixed-integer linear programming solver (MILP), mixed-integer quadratic programming solver (MIQP), and mixed-integer quadratically constrained programming solver (MIQCP). The solvers in the Gurobi Optimizer were designed from the ground up to exploit modern architectures and multi-core processors, using the most advanced implementations of the latest algorithms. To help set you up for success, the Gurobi Optimizer goes beyond fast and reliable solution performance to provide a broad range of interfaces, access to industry-standard modeling languages, flexible licensing together with transparent pricing, and outstanding, easy to reach, support.
Keywords for this software
References in zbMATH (referenced in 141 articles )
Showing results 1 to 20 of 141.
Sorted by year (citations)
- Ahmadi, Amir Ali; Hall, Georgina: Sum of squares basis pursuit with linear and second order cone programming (2017)
- Blanco, Víctor; Puerto, Justo; Ponce, Diego: Continuous location under the effect of `refraction’ (2017)
- Diamond, Steven; Boyd, Stephen: Stochastic matrix-free equilibration (2017)
- Dunning, Iain; Huchette, Joey; Lubin, Miles: JuMP: a modeling language for mathematical optimization (2017)
- Gould, Nicholas I.M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)
- Hart, William E.; Laird, Carl D.; Watson, Jean-Paul; Woodruff, David L.; Hackebeil, Gabriel A.; Nicholson, Bethany L.; Siirola, John D.: Pyomo -- optimization modeling in Python (2017)
- Li, Han-Lin; Huang, Yao-Huei; Fang, Shu-Cherng: Linear reformulation of polynomial discrete programming for fast computation (2017)
- Liu, Meijiao; Liu, Yong-Jin: Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (2017)
- Palacio, Juan D.; Larrea, Olga L.: A lexicographic approach to the robust resource-constrained project scheduling problem (2017)
- Ahmadi, Amir Ali; Majumdar, Anirudha: Some applications of polynomial optimization in operations research and real-time decision making (2016)
- Alabdulmohsin, Ibrahim; Cisse, Moustapha; Gao, Xin; Zhang, Xiangliang: Large margin classification with indefinite similarities (2016)
- Anjos, Miguel F.; Fischer, Anja; Hungerländer, Philipp: Solution approaches for the double-row equidistant facility layout problem (2016)
- Bamberg, John; Lee, Melissa; Swartz, Eric: A note on relative hemisystems of Hermitian generalised quadrangles (2016)
- Bertsimas, Dimitris; de Ruiter, Frans J.C.T.: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds (2016)
- Bertsimas, Dimitris; Dunning, Iain: Multistage robust mixed-integer optimization with adaptive partitions (2016)
- Bertsimas, Dimitris; King, Angela: OR forum: An algorithmic approach to linear regression (2016)
- Bertsimas, Dimitris; King, Angela; Mazumder, Rahul: Best subset selection via a modern optimization lens (2016)
- Borndörfer, Ralf; Schenker, Sebastian; Skutella, Martin; Strunk, Timo: PolySCIP (2016)
- Buchheim, Christoph; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco; Trieu, Long: A feasible active set method with reoptimization for convex quadratic mixed-integer programming (2016)
- Burdakov, Oleg P.; Kanzow, Christian; Schwartz, Alexandra: Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method (2016)