Gurobi
PulseAugur coverage of Gurobi — every cluster mentioning Gurobi across labs, papers, and developer communities, ranked by signal.
2 day(s) with sentiment data
-
New RL method automates optimization modeling from natural language
Researchers have developed a new method called Optimization Modeling from Solver Outcomes (OMSO) that uses reinforcement learning to automate the creation of optimization models from natural language descriptions. This …
-
FPGA-based neuromorphic Ising machine optimizes power grids in real-time
Researchers have developed a novel FPGA-based neuromorphic Ising machine capable of optimizing power grids in real-time. This system utilizes a higher-order Ising formulation to represent Distribution Network Reconfigur…
-
Meta AI open-sources Rebalancer for large-scale assignment problems
Meta AI has open-sourced Rebalancer, a C++ library with a Python interface designed to solve complex assignment problems, such as resource allocation in large-scale datacenters. The tool separates problem specification …
-
Photonic quantum solvers benchmarked against classical methods for financial risk detection
Researchers have evaluated the performance of photonic quantum solvers against classical optimization methods for feature selection in financial risk detection. The study compared Gurobi (classical), QCI Dirac-3 (photon…
-
New SAT-based framework tackles graph labeling problems
Researchers have introduced a new framework for solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling (MSABL/MSCABL) problems. These problems are variations of graph labeling tasks that focus on minimizin…
-
New AI method accelerates MILP solving by predicting solution consistency · 2 sources tracked
Researchers have developed a novel approach to accelerate Mixed-Integer Linear Programming (MILP) solving by focusing on the consistency between early-stage and final solutions. This method predicts whether early variab…
-
New ODTlearn Python package enables optimal decision tree learning
A new open-source Python package called ODTlearn has been released, designed for learning optimal decision trees. This package implements state-of-the-art mixed-integer optimization frameworks for predictive and prescri…
-
LLM generates graphs for constraint optimization, outperforming Gurobi baseline
Researchers have developed a novel pipeline that uses Large Language Models (LLMs) to generate problem-agnostic graphs for constraint optimization problems. By prompting an LLM with semantic guidelines, the system creat…
-
New method mines railway rescheduling models from scattered research
Researchers have developed a new method called LP Mining with LP2Graph to systematically extract and organize knowledge from hundreds of scattered Mixed-Integer Linear Programming (MILP) papers. This approach represents…
-
New method structures railway rescheduling knowledge from hundreds of MILP papers
Researchers have developed LP Mining with LP2Graph, a novel method to extract and structure knowledge from hundreds of papers on Mixed-Integer Linear Programming (MILP) used in railway rescheduling. This approach repres…
-
New method predicts hardness for combinatorial auction problems
A research paper proposes a new approach to solving the Winner Determination Problem (WDP) in combinatorial auctions, which is known to be NP-hard. Instead of trying to replace existing solvers with graph neural network…
-
New algorithm tackles Nash equilibrium in complex multiplayer games · 3 sources tracked
Researchers have developed a new algorithm called Projected Exploitability Descent (PED) for approximating Nash equilibria in complex multiplayer games with imperfect information. This algorithm minimizes a proxy for th…
-
LLM constraint injection method boosts optimization modeling accuracy
Researchers have developed a new method called constraint injection to improve how large language models handle complex optimization problems. This technique addresses the issue of LLMs incorrectly adding or omitting co…
-
New Solver-Free Framework Tackles Integer Linear Programming
Researchers have developed a novel solver-free framework for tackling Integer Linear Programming (ILP) problems, which are common in combinatorial optimization. This new method directly explores feasible regions without…