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 309 articles )
Showing results 1 to 20 of 309.
Sorted by year (- Aswani, Anil; Kaminsky, Philip; Mintz, Yonatan; Flowers, Elena; Fukuoka, Yoshimi: Behavioral modeling in weight loss interventions (2019)
- Bagger, Niels-Christian F.; Sørensen, Matias; Stidsen, Thomas R.: Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling (2019)
- Burgelman, Jeroen; Vanhoucke, Mario: Computing project makespan distributions: Markovian PERT networks revisited (2019)
- Contardo, Claudio; Iori, Manuel; Kramer, Raphael: A scalable exact algorithm for the vertex $p$-center problem (2019)
- Dowson, Oscar; Philpott, Andy; Mason, Andrew; Downward, Anthony: A multi-stage stochastic optimization model of a pastoral dairy farm (2019)
- Dursun, Pınar; Taşkın, Z. Caner; Altınel, İ. Kuban: The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) (2019)
- Hesaraki, Alireza F.; Dellaert, Nico P.; de Kok, Ton: Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan (2019)
- Krumke, Sven O.; Schmidt, Eva; Streicher, Manuel: Robust multicovers with budgeted uncertainty (2019)
- Liuzzi, G.; Locatelli, M.; Piccialli, Veronica: A new branch-and-bound algorithm for standard quadratic programming problems (2019)
- Moon, Han-Bom; Swinarski, David: On the $S_n$-invariant F-conjecture (2019)
- Polak, Sven C.; Schrijver, Alexander: New lower bound on the Shannon capacity of $C_7$ from circular graphs (2019)
- Schiewe, Alexander; Schiewe, Philine; Schmidt, Marie: The line planning routing game (2019)
- Wang, Xingyin; Golden, Bruce; Wasil, Edward: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (2019)
- Abdallah, L.; Haddou, M.; Migot, T.: Solving absolute value equation using complementarity and smoothing functions (2018)
- Angelini, Patrizio; Da Lozzo, Giordano; Di Bartolomeo, Marco; Di Donato, Valentino; Patrignani, Maurizio; Roselli, Vincenzo; Tollis, Ioannis G.: Algorithms and bounds for L-drawings of directed graphs (2018)
- Atan, Tankut; Çavdaroğlu, Burak: Minimization of rest mismatches in round Robin tournaments (2018)
- Atan, Tankut; Eren, Elif: Optimal project duration for resource leveling (2018)
- Avis, David; Jordan, Charles: mplrs: a scalable parallel vertex/facet enumeration code (2018)
- Bagger, Niels-Christian F.; Sørensen, Matias; Stidsen, Thomas R.: Benders decomposition for curriculum-based course timetabling (2018)
- Bamberg, John; Lansdown, Jesse; Lee, Melissa: On $m$-ovoids of regular near polygons (2018)