


default search action
Open Journal of Mathematical Optimization, Volume 2
Volume 2, 2021
- Giacomo Nannicini:
On the implementation of a global optimization method for mixed-variable problems. 1-25 - Edvin Åblad
, Ann-Brith Strömberg, Domenico Spensieri
:
Exact makespan minimization of unrelated parallel machines. 1-15 - Marc Goerigk, Stefan Lendl:
Robust Combinatorial Optimization with Locally Budgeted Uncertainty. 1-18 - Salihah Alwadani, Heinz H. Bauschke, Julian P. Revalski, Xianfu Wang:
The difference vectors for convex sets and a resolution of the geometry conjecture. 1-18 - Jérémy Omer, Antonio Mucherino:
The Referenced Vertex Ordering Problem: Theory, Applications, and Solution Methods. 1-29 - Giovanni Righini:
Efficient optimization of the Held-Karp lower bound. 1-17 - Marcia Fampa, Jon Lee, Gabriel Ponte
:
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. 1-14 - Peng Zheng, Karthikeyan Natesan Ramamurthy, Aleksandr Y. Aravkin:
Estimating Shape Parameters of Piecewise Linear-Quadratic Problems. 1-18 - Wim van Ackooij
, Pedro Pérez-Aros:
Gradient formulae for probability functions depending on a heterogenous family of constraints. 1-29

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.