Author of the publication

Continuous Relaxations for Constrained Maximum-Entropy Sampling.

, , , and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 234-248. Springer, (1996)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Continuous Relaxations for Constrained Maximum-Entropy Sampling., , , and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 234-248. Springer, (1996)Two linear approximation algorithms for convex mixed integer nonlinear programming., , and . Ann. Oper. Res., 316 (2): 1471-1491 (2022)Experimental analysis of local searches for sparse reflexive generalized inverses., , , and . J. Glob. Optim., 81 (4): 1057-1093 (2021)Maximum-entropy remote sampling., , , and . Discret. Appl. Math., 108 (3): 211-226 (2001)Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem., , and . ACDA, page 110-118. SIAM, (2023)On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space., , , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 122-133. Springer, (2015)An Outer-Approximation Algorithm for Maximum-Entropy Sampling., and . ISCO, volume 13526 of Lecture Notes in Computer Science, page 130-142. Springer, (2022)Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming., , and . J. Glob. Optim., 60 (2): 373-389 (2014)On Sparse Reflexive Generalized Inverses., and . CoRR, (2018)An overview of exact algorithms for the Euclidean Steiner tree problem in n-space., , and . ITOR, 23 (5): 861-874 (2016)