( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem.

, , и . ACDA, стр. 110-118. SIAM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Marcia Zeitoune

Marco Marcia

Marcia Begalli

Marcia Rosetto

Marcia Machein

 

Другие публикации лиц с тем же именем

Extensions on ellipsoid bounds for quadratic integer programming., и . J. Glob. Optim., 71 (3): 457-482 (2018)An overview of MINLP algorithms and their implementation in Muriqui Optimizer., , и . Ann. Oper. Res., 286 (1): 217-241 (2020)Tractable Relaxations for the Cubic One-Spherical Optimization Problem., , и . WCGO, том 991 из Advances in Intelligent Systems and Computing, стр. 267-276. Springer, (2019)Diving for Sparse Partially-Reflexive Generalized Inverses., , и . WCGO, том 991 из Advances in Intelligent Systems and Computing, стр. 89-98. Springer, (2019)An overview of exact algorithms for the Euclidean Steiner tree problem in n-space., , и . ITOR, 23 (5): 861-874 (2016)Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming., , и . J. Glob. Optim., 60 (2): 373-389 (2014)Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses., , и . CoRR, (2020)On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs., , , и . Optim. Lett., 14 (2): 409-415 (2020)Modified Extended Cutting Plane Algorithm for Mixed Integer Nonlinear Programming., , и . WCGO, том 991 из Advances in Intelligent Systems and Computing, стр. 428-437. Springer, (2019)Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses., , и . Open J. Math. Optim., (2021)