Mathematical Programming Computation (2023). [2] Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. Foundations of Computational Mathematics (2019).

Optimisation techniques in this domain blend combinatorial methods with continuous optimisation approaches, such as linear programming relaxations, to obtain provably efficient and near-optimal ...

The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO XXI) took place online on June 8-10. The conference was preceded by an online Summer School on June 6-7. The conference ...

ABSTRACT The Least Cost Influence Problem is a combinatorial optimization problem that appears in the context of social networks. The objective is to give incentives to individuals of a network, such ...

A production workshop with mobile robots can be considered as a hybrid system consisting of a production system and a transportation one. Mobile robots are responsible for transferring production ...

Considers offline optimization of a switching sequence for a given finite set of linear control systems, together with joint optimization of control laws. A linear quadratic full information criterion ...

Fit-ligand is a computational algorithm that enables accurate modeling of multiple conformational states of ligands in X-ray crystallography and cryo-electron microscopy (cryo-EM).

Kipu Quantum and IonQ (NYSE: IONQ) announced what they said is a record achievement: the successful solution of "the most ...

Other Solvers COPT: a mathematical optimization solver for large-scale problems. CPLEX: a high-performance mathematical programming solver for linear programming, mixed integer programming, and ...

python optimization ampl linear-programming milp modeling-language nonlinear-optimization nonlinear-programming mip integer-programming mixed-integer-programming linear-optimization ...