activity
20202026
most citedBranch-and-bound for D-Optimality with fast local search and variable-bound tightening

2 citations · 3 across the 11 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

math.OC2026

New insights into the NLP-Id bound for maximum-entropy sampling

Kurt Anstreicher, Marcia Fampa, Jon Lee +2

We establish new properties of the NLP-Id upper bound for the maxi\-mum-entropy sampling problem (MESP). In particular, we give a detailed look at the concavity of its objective fu…

math.OC2026

The hyper-scaled NLP bound for maximum-entropy remote sampling

Gabriel Ponte, Marcia Fampa, Jon Lee

The maximum-entropy remote sampling problem (MERSP) is to select a subset of random variables from a set of random variables, so as to maximize the information concerning a…