Linear and Integer Programming vs Linear Integration and Counting

DOI10.1007/978-0-387-09414-4MaRDI QIDQ5503570zbMATH OpenOpenAlexFDO

Authors Jean B. 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

integer programminglinear countinglinear integrationlinear programming

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2159273
• Generating functions and duality for integer programs
• Duality in mathematics and linear and integer programming
• Duality and a Farkas lemma for integer programs
• scientific article; zbMATH DE number 4089320

Cited in

(12)

• Generating functions and duality for integer programs
• Exploiting symmetries in polyhedral computations
• Duality and a Farkas lemma for integer programs
• scientific article; zbMATH DE number 2159273 (Why is no real title available?)
• Computing Optimized Path Integrals for Knapsack Feasibility
• Counting integral points in polytopes via numerical analysis of contour integration
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
• Counting as integration in feasible analysis
• Enumeration and unimodular equivalence of empty delta-modular simplices
• \(L^{p}\)-norms, log-barriers and Cramer transform in optimization
• Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
• A new and faster representation for counting integer points in parametric polyhedra

Describes a project that uses

Uses Software

• LattE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503570)