Linear and Integer Programming vs Linear Integration and Counting

DOI10.1007/978-0-387-09414-4zbMath1188.90170OpenAlexW2496974436MaRDI QIDQ5503570

Jean-Bernard Lasserre

Publication date: 15 January 2009

Published in: Springer Series in Operations Research and Financial Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-09414-4

zbMATH Keywords

linear programminginteger programminglinear integrationlinear counting

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (7)

\(L^{p}\)-norms, log-barriers and Cramer transform in optimization ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems ⋮ Exploiting Symmetries in Polyhedral Computations

Uses Software

• LattE

This page was built for publication: Linear and Integer Programming vs Linear Integration and Counting