scientific article; zbMATH DE number 1985302

MaRDI QIDQ4429166zbMATH OpenFDO

Authors Don Coppersmith, Jon Lee

Publication date 24 September 2003

zbMATH Keywords

facetspolytopesfactoring

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Factorization; primality (11A51)

Recommendations

• Cropped cubes
• Polytopes of partitions of numbers
• Some efficiently solvable problems over integer partition polytopes
• Decomposition of polytopes and polynomials
• Integral polytopes and polynomial factorization

Cited in

(10)

• Solving multiplicative programs by binary-encoding the multiplication operation
• Cropped cubes
• Idealness and 2-resistant sets
• The Role of Indivisibles in Mengoli’s Quadratures
• Indivisible plexes in Latin squares
• Volume computation for sparse Boolean quadric relaxations
• Indivisibles and Latitude of Forms
• Bounded remainder polyhedra
• scientific article; zbMATH DE number 1810571 (Why is no real title available?)
• Embedding divisor and semi-prime testability in \(f\)-vectors of polytopes

This page was built for publication:

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