On computing with some convex relaxations for the maximum-entropy sampling problem
Year of publication: |
2023
|
---|---|
Authors: | Chen, Zhongzhu ; Fampa, Marcia Helena Costa ; Lee, Jon |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 35.2023, 2, p. 368-385
|
Subject: | convex relaxation | integer nonlinear optimization | maximum-entropy sampling | mixing bounds | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Stichprobenerhebung | Sampling |
-
Efficient solution of maximum-entropy sampling problems
Anstreicher, Kurt M., (2020)
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
-
A note on appointment scheduling with piecewise linear cost functions
Ge, Dongdong, (2014)
- More ...
-
Technical note: masking Anstreicher’s linx bound for improved entropy bounds
Chen, Zhongzhu, (2024)
-
On sparse reflexive generalized inverse
Fampa, Marcia Helena Costa, (2018)
-
On global optimization with indefinite quadratics
Fampa, Marcia Helena Costa, (2017)
- More ...