Basic properties of lattices of cubes, algorithms for their construction, and application capabilities in discrete optimization.

DOI10.1134/S0965542515010108zbMath1317.06009MaRDI QIDQ2354423

Yanyan Li

Publication date: 13 July 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationhypercubesmathematical programmingsupermodular functionsdiscrete optimizationfinite latticespower setssubmodular functionslattices of cubes

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Combinatorial optimization (90C27) Representation theory of lattices (06B15) Structure theory of lattices (06B05)

Related Items (1)

Single- and multiobjective optimization on the lattice of cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice of cubes
• Supermodular programming on finite lattices

This page was built for publication: Basic properties of lattices of cubes, algorithms for their construction, and application capabilities in discrete optimization.