I am working on an algorithmic refinement for separable MINLP, and decided (upon suggestion from one of the reviewers) to try Gurobi 12's MINLP capabilities. It is still slower and solves less instances than our solver, but proves much faster and efficient than Baron and/or SCIP #orms
November 21, 2024 at 5:20 PM
I am working on an algorithmic refinement for separable MINLP, and decided (upon suggestion from one of the reviewers) to try Gurobi 12's MINLP capabilities. It is still slower and solves less instances than our solver, but proves much faster and efficient than Baron and/or SCIP #orms
Timo Berthold strikes again at #cpaior2026 by talking about how to beat DeepMind’s AlphaEvolve geometric packing algorithms with off-the-shelf MINLP solvers.
1/N
1/N
May 29, 2026 at 3:35 PM
Timo Berthold strikes again at #cpaior2026 by talking about how to beat DeepMind’s AlphaEvolve geometric packing algorithms with off-the-shelf MINLP solvers.
1/N
1/N
Next week continues with the MINLP course, with an emphasis on generalized Benders for MI-convex problems. Students also have articles to read, analyze, and present to the whole group in January
The lectures on convex and mixed-integer optimization continued, with one on conic optimization, with two types of motivating examples:
1) problems that are naturally nonlinear (e.g. power systems)
2) combinatorial problems with of course max-cut as a running example
1) problems that are naturally nonlinear (e.g. power systems)
2) combinatorial problems with of course max-cut as a running example
December 1, 2024 at 2:44 PM
Next week continues with the MINLP course, with an emphasis on generalized Benders for MI-convex problems. Students also have articles to read, analyze, and present to the whole group in January
My PhD student Xiaocong and I wrote a chapter on congressional apportionment, emphasizing the connections between mathematical optimization and classical apportionment methods (e.g., Jefferson, Adams, Hamilton, Webster, Huntington-Hill). Each solves an MINLP optimization-online.org/2026/08/cong...
Congressional Apportionment – Optimization Online
optimization-online.org
August 17, 2026 at 4:02 PM
My PhD student Xiaocong and I wrote a chapter on congressional apportionment, emphasizing the connections between mathematical optimization and classical apportionment methods (e.g., Jefferson, Adams, Hamilton, Webster, Huntington-Hill). Each solves an MINLP optimization-online.org/2026/08/cong...
Questions about #Gurobi12? Join our upcoming webinar to explore the latest #MINLP capabilities, advanced resource management features, and our revamped, user-friendly documentation. Don’t wait—register today: www.gurobi.com/whats-new-gu...
#OperationsResearch #DataScience #Optimization
#OperationsResearch #DataScience #Optimization
December 7, 2024 at 12:43 AM
Questions about #Gurobi12? Join our upcoming webinar to explore the latest #MINLP capabilities, advanced resource management features, and our revamped, user-friendly documentation. Don’t wait—register today: www.gurobi.com/whats-new-gu...
#OperationsResearch #DataScience #Optimization
#OperationsResearch #DataScience #Optimization
Really fun problem set with its unique challenges sitting at the intersection of MIP and MINLP. We chose to tackle it from the lenses of nonlinear optimization to experiment new areas
June 4, 2025 at 9:47 PM
Really fun problem set with its unique challenges sitting at the intersection of MIP and MINLP. We chose to tackle it from the lenses of nonlinear optimization to experiment new areas
By avoiding frequent MINLP calls and updating the upper bound less often, the approach outperforms enumeration overall.
July 2, 2025 at 4:10 PM
By avoiding frequent MINLP calls and updating the upper bound less often, the approach outperforms enumeration overall.
On Sunday evening, while working on a side project, I created a new Python environment with uv (astral.sh/blog/uv) and discovered that Gurobi has switched to version 12.0.
Now, Gurobi can solve Global MINLP to optimality, wow!
gurobi.com/whats-new-gu...
It only needs to move to BluseSky ...
Now, Gurobi can solve Global MINLP to optimality, wow!
gurobi.com/whats-new-gu...
It only needs to move to BluseSky ...
uv: Python packaging in Rust
uv is an extremely fast Python package installer and resolver, designed as a drop-in alternative to pip and pip-tools.
astral.sh
November 17, 2024 at 5:47 PM
On Sunday evening, while working on a side project, I created a new Python environment with uv (astral.sh/blog/uv) and discovered that Gurobi has switched to version 12.0.
Now, Gurobi can solve Global MINLP to optimality, wow!
gurobi.com/whats-new-gu...
It only needs to move to BluseSky ...
Now, Gurobi can solve Global MINLP to optimality, wow!
gurobi.com/whats-new-gu...
It only needs to move to BluseSky ...
Thurauf introduces a restricted bilevel reformulation, proves optimality conditions for the nonlinear follower problem using properties of potential-based flows, and derives an equivalent single-level MINLP that makes (upper) bounding more tractable.
July 2, 2025 at 4:06 PM
Thurauf introduces a restricted bilevel reformulation, proves optimality conditions for the nonlinear follower problem using properties of potential-based flows, and derives an equivalent single-level MINLP that makes (upper) bounding more tractable.
Whereas branch-and-cut can be used in both cases, the cost of solving relaxations in MINLP matters a lot.
By using a quadratic objective function rather than a quadratic constraint in portfolio optimization, the problem gets solved faster with a first-order method for the relaxation.
2/N
By using a quadratic objective function rather than a quadratic constraint in portfolio optimization, the problem gets solved faster with a first-order method for the relaxation.
2/N
June 2, 2025 at 9:35 PM
Whereas branch-and-cut can be used in both cases, the cost of solving relaxations in MINLP matters a lot.
By using a quadratic objective function rather than a quadratic constraint in portfolio optimization, the problem gets solved faster with a first-order method for the relaxation.
2/N
By using a quadratic objective function rather than a quadratic constraint in portfolio optimization, the problem gets solved faster with a first-order method for the relaxation.
2/N
Nonconvex MINLP with sequence and space dependencies makes every decision interconnected (pumps, pipes, tanks etc.). Rather than solving end‑to‑end, the goal is to find one feasible solution by disconnecting the problem into scalable and solvable parts.
July 3, 2025 at 3:18 PM
Nonconvex MINLP with sequence and space dependencies makes every decision interconnected (pumps, pipes, tanks etc.). Rather than solving end‑to‑end, the goal is to find one feasible solution by disconnecting the problem into scalable and solvable parts.
Erik Tamm, Gabriele Eichfelder, Jan Kronqvist
Warm-starting outer approximation for parametrized convex MINLP
https://arxiv.org/abs/2507.08595
Warm-starting outer approximation for parametrized convex MINLP
https://arxiv.org/abs/2507.08595
July 14, 2025 at 4:27 AM
Erik Tamm, Gabriele Eichfelder, Jan Kronqvist
Warm-starting outer approximation for parametrized convex MINLP
https://arxiv.org/abs/2507.08595
Warm-starting outer approximation for parametrized convex MINLP
https://arxiv.org/abs/2507.08595
📚 New Arxiv Paper
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
May 5, 2026 at 8:02 AM
📚 New Arxiv Paper
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
🔄 Updated Arxiv Paper
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
August 14, 2026 at 8:02 AM
🔄 Updated Arxiv Paper
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
Title: A computational comparison of handling distance constraints in MINLP
Authors: Christopher Hojny, Leo Liberti
Read more: https://arxiv.org/abs/2605.02305
Pivot irrigators in a 100 acre field
We formulate a non-linear, non-convex model for optimizing the layout of centre-pivot irrigators in a field.
Several solvers fail to find good solutions. Can the MINLP-BB solver via NEOS find an optimal solution?
#orms #Python
www.solvermax.com/blog/pivot-i...
We formulate a non-linear, non-convex model for optimizing the layout of centre-pivot irrigators in a field.
Several solvers fail to find good solutions. Can the MINLP-BB solver via NEOS find an optimal solution?
#orms #Python
www.solvermax.com/blog/pivot-i...
April 2, 2025 at 9:40 PM
Pivot irrigators in a 100 acre field
We formulate a non-linear, non-convex model for optimizing the layout of centre-pivot irrigators in a field.
Several solvers fail to find good solutions. Can the MINLP-BB solver via NEOS find an optimal solution?
#orms #Python
www.solvermax.com/blog/pivot-i...
We formulate a non-linear, non-convex model for optimizing the layout of centre-pivot irrigators in a field.
Several solvers fail to find good solutions. Can the MINLP-BB solver via NEOS find an optimal solution?
#orms #Python
www.solvermax.com/blog/pivot-i...
The #SCIP Optimization Suite 10.0.0 has been released!
Many new features, including exact MILP solving. Release report: optimization-online.org/2025/11/the-... Download this new major release at www.scipopt.org #Optimization mixed integer programming #MIP mixed integer nonlinear programming #MINLP
Many new features, including exact MILP solving. Release report: optimization-online.org/2025/11/the-... Download this new major release at www.scipopt.org #Optimization mixed integer programming #MIP mixed integer nonlinear programming #MINLP
November 25, 2025 at 12:15 PM
The #SCIP Optimization Suite 10.0.0 has been released!
Many new features, including exact MILP solving. Release report: optimization-online.org/2025/11/the-... Download this new major release at www.scipopt.org #Optimization mixed integer programming #MIP mixed integer nonlinear programming #MINLP
Many new features, including exact MILP solving. Release report: optimization-online.org/2025/11/the-... Download this new major release at www.scipopt.org #Optimization mixed integer programming #MIP mixed integer nonlinear programming #MINLP
Our paper "Convex mixed-integer optimization with Frank-Wolfe methods" (Hendrych, Troppens, Besançon) won the MPC Outstanding Paper of the Year Award 2025 🎉
Result: Boscia.jl — compact open-source MINLP solver, FW over the convex hull of mixed-integer points in branch-and-bound. No outer approx.
Result: Boscia.jl — compact open-source MINLP solver, FW over the convex hull of mixed-integer points in branch-and-bound. No outer approx.
August 16, 2026 at 8:48 AM
Our paper "Convex mixed-integer optimization with Frank-Wolfe methods" (Hendrych, Troppens, Besançon) won the MPC Outstanding Paper of the Year Award 2025 🎉
Result: Boscia.jl — compact open-source MINLP solver, FW over the convex hull of mixed-integer points in branch-and-bound. No outer approx.
Result: Boscia.jl — compact open-source MINLP solver, FW over the convex hull of mixed-integer points in branch-and-bound. No outer approx.
SCIP Optimization Suite 10.0 is out 🎉
→ Numerically exact solving mode for rational MILPs
→ 9-20% faster on hard MINLPs
→ IIS detection for debugging infeasible models
→ Better symmetry handling
... and many more
For full details see:
www.pokutta.com/blog/resear...
#optimization
→ Numerically exact solving mode for rational MILPs
→ 9-20% faster on hard MINLPs
→ IIS detection for debugging infeasible models
→ Better symmetry handling
... and many more
For full details see:
www.pokutta.com/blog/resear...
#optimization
SCIP Optimization Suite 10.0: Exact Solving, Better Decompositions, and a More Productive Ecosystem
TL;DR: SCIP Optimization Suite 10.0 brings a numerically exact solving mode for rational MILPs, noticeable performance gains for MILP/MINLP, stronger presolving and symmetry handling, better heuristics and conflict analysis, IIS detection, and major updates to GCG, PaPILO, PySCIPOpt, and MIP-DD.
www.pokutta.com
December 5, 2025 at 11:27 AM
SCIP Optimization Suite 10.0 is out 🎉
→ Numerically exact solving mode for rational MILPs
→ 9-20% faster on hard MINLPs
→ IIS detection for debugging infeasible models
→ Better symmetry handling
... and many more
For full details see:
www.pokutta.com/blog/resear...
#optimization
→ Numerically exact solving mode for rational MILPs
→ 9-20% faster on hard MINLPs
→ IIS detection for debugging infeasible models
→ Better symmetry handling
... and many more
For full details see:
www.pokutta.com/blog/resear...
#optimization
Discover what’s new in #Gurobi12! Join one of our webinars this week to explore the latest features and enhancements including new #MINLP capabilities, revamped, user-friendly documentation, and upgrades to Cluster Manager and Compute Server. Save your seat today: www.gurobi.com/events/webin...
December 9, 2024 at 6:54 PM
Discover what’s new in #Gurobi12! Join one of our webinars this week to explore the latest features and enhancements including new #MINLP capabilities, revamped, user-friendly documentation, and upgrades to Cluster Manager and Compute Server. Save your seat today: www.gurobi.com/events/webin...
Optimization Algorithms for Joint OFDM Waveform Design and RIS Configuration in 6G Networks: From Convex Relaxation to Foundation Models
Ahmet Kaplan
#arXiv #cs.AI
Ahmet Kaplan
#arXiv #cs.AI
Optimization Algorithms for Joint OFDM Waveform Design and RIS Configuration in 6G Networks: From Convex Relaxation to Foundation Models
Joint OFDM-RIS optimization for 6G is a mixed-integer nonlinear programming (MINLP) problem covering sum-rate maximization, energy efficiency, max-min fairness, and peak-to-average power ratio (PAPR)-constrained objectives. Seventy-eight joint OFDM-RIS optimization works published between 2021 and …
arxiv.org
July 1, 2026 at 8:48 PM
Evaluación comparativa del recocido cuántico (D-Wave), la computación de entropía (QCi Dirac-1) y el recocido simulado frente a Gurobi para MINLPs de diseño de procesos: los solvers clásicos ganan en velocidad, pero las heurísticas de Ising sobresalen en diversidad de solucion...
Descomposición Híbrida Clásica-Cuántica para la Optimización del Diseño de Procesos MINLP
iq.fp2.dev
March 23, 2026 at 2:27 AM
Evaluación comparativa del recocido cuántico (D-Wave), la computación de entropía (QCi Dirac-1) y el recocido simulado frente a Gurobi para MINLPs de diseño de procesos: los solvers clásicos ganan en velocidad, pero las heurísticas de Ising sobresalen en diversidad de solucion...
השוואת ביצועים בין אניאלינג קוונטי (D-Wave), מחשוב אנטרופיה (QCi Dirac-1) ואניאלינג מדומה מול Gurobi עבור בעיות MINLP בתכנון תהליכים: פותרים קלאסיים מנצחים במהירות, אך היוריסטיקות של Ising מצטיינות במגוון פתרונות — קריטי לקבלת החלטות בעולם האמיתי.
#מחשוב_קוונטי #הנדסת_תהליכים #מחקר
#מחשוב_קוונטי #הנדסת_תהליכים #מחקר
פירוק היברידי קלאסי-קוונטי לאופטימיזציית תכנון תהליכים ב-MINLP
iq.fp2.dev
March 23, 2026 at 2:29 AM
השוואת ביצועים בין אניאלינג קוונטי (D-Wave), מחשוב אנטרופיה (QCi Dirac-1) ואניאלינג מדומה מול Gurobi עבור בעיות MINLP בתכנון תהליכים: פותרים קלאסיים מנצחים במהירות, אך היוריסטיקות של Ising מצטיינות במגוון פתרונות — קריטי לקבלת החלטות בעולם האמיתי.
#מחשוב_קוונטי #הנדסת_תהליכים #מחקר
#מחשוב_קוונטי #הנדסת_תהליכים #מחקר
Đánh giá hiệu năng của luyện kim lượng tử (D-Wave), điện toán entropy (QCi Dirac-1) và luyện kim mô phỏng so với Gurobi cho các bài toán MINLP thiết kế quy trình: các bộ giải cổ điển chiếm ưu thế về tốc độ, nhưng heuristic Ising vượt trội về tính đa dạng nghiệm—yếu tố then chố...
Phân rã Lai Cổ điển-Lượng tử cho Tối ưu hóa Thiết kế Quy trình MINLP
iq.fp2.dev
March 23, 2026 at 2:28 AM
Đánh giá hiệu năng của luyện kim lượng tử (D-Wave), điện toán entropy (QCi Dirac-1) và luyện kim mô phỏng so với Gurobi cho các bài toán MINLP thiết kế quy trình: các bộ giải cổ điển chiếm ưu thế về tốc độ, nhưng heuristic Ising vượt trội về tính đa dạng nghiệm—yếu tố then chố...
プロセス設計MINLPに対して、量子アニーリング（D-Wave）、エントロピーコンピューティング（QCi Dirac-1）、シミュレーテッドアニーリングをGurobiと比較ベンチマーク：古典ソルバーは速度で優位に立つが、イジングヒューリスティクスは解の多様性に優れており、実世界の意思決定において重要な役割を果たす。
#量子コンピューティング #プロセスエンジニアリング #研究
#量子コンピューティング #プロセスエンジニアリング #研究
MINLP プロセス設計最適化のためのハイブリッド古典-量子分解法
iq.fp2.dev
March 23, 2026 at 2:26 AM
プロセス設計MINLPに対して、量子アニーリング（D-Wave）、エントロピーコンピューティング（QCi Dirac-1）、シミュレーテッドアニーリングをGurobiと比較ベンチマーク：古典ソルバーは速度で優位に立つが、イジングヒューリスティクスは解の多様性に優れており、実世界の意思決定において重要な役割を果たす。
#量子コンピューティング #プロセスエンジニアリング #研究
#量子コンピューティング #プロセスエンジニアリング #研究
प्रक्रिया डिज़ाइन MINLPs के लिए क्वांटम एनीलिंग (D-Wave), एन्ट्रॉपी कंप्यूटिंग (QCi Dirac-1), और सिमुलेटेड एनीलिंग बनाम Gurobi का बेंचमार्किंग: क्लासिकल सॉल्वर गति में आगे हैं, लेकिन Ising ह्यूरिस्टिक्स समाधान विविधता में उत्कृष्ट हैं—जो वास्तविक दुनिया के निर्णय-निर्माण के लि...
MINLP प्रक्रिया डिज़ाइन अनुकूलन के लिए हाइब्रिड क्लासिकल-क्वांटम विघटन
iq.fp2.dev
March 23, 2026 at 2:28 AM
प्रक्रिया डिज़ाइन MINLPs के लिए क्वांटम एनीलिंग (D-Wave), एन्ट्रॉपी कंप्यूटिंग (QCi Dirac-1), और सिमुलेटेड एनीलिंग बनाम Gurobi का बेंचमार्किंग: क्लासिकल सॉल्वर गति में आगे हैं, लेकिन Ising ह्यूरिस्टिक्स समाधान विविधता में उत्कृष्ट हैं—जो वास्तविक दुनिया के निर्णय-निर्माण के लि...