Continuous relaxations for Constrained Maximum-Entropy Sampling

DOI10.1007/3-540-61310-2_18zbMath1415.90057OpenAlexW1539649017MaRDI QIDQ4645926

Kurt M. Anstreicher, Joy Williams, Jon Lee, Márcia H. C. Fampa

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_18

zbMATH Keywords

principal submatrixcontinuous relaxationrelative interiordual solutionunconstrained case

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (8)

Generalized maximum-entropy sampling ⋮ Tridiagonal maximum-entropy sampling and tridiagonal masks ⋮ An outer-approximation algorithm for maximum-entropy sampling ⋮ Efficient Solution of Maximum-Entropy Sampling Problems ⋮ Maximum-entropy sampling and the Boolean quadric polytope ⋮ Maximum-entropy remote sampling ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Approximately optimal subset selection for statistical design and modelling

Uses Software

• LAPACK
• CPLEX

Cites Work

• A Mathematical Theory of Communication
• Optimal monitoring network designs
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Matrix Analysis
• Comparison of two approaches in the optimal design of an observation network
• An Exact Algorithm for Maximum Entropy Sampling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous relaxations for Constrained Maximum-Entropy Sampling