scientific article

zbMath1274.90500MaRDI QIDQ2861569

Pierre Hansen, Leo Liberti, Alberto L. C. Costa

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001666

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Exploiting symmetries in mathematical programming via orbital independence, Symmetry in Mathematical Programming, Orbital Independence in Symmetric Mathematical Programs, A multiplicative weights update algorithm for MINLP, Variable symmetry breaking in numerical constraint problems, Stabilizer-based symmetry breaking constraints for mathematical programs, Packing Unit Spheres into a Cube Using VNS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Packing equal circles in a square: A deterministic global optimization approach
• New formulations for the Kissing Number Problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• Symmetry in Integer Linear Programming
• Reformulations in Mathematical Programming: Definitions and Systematics
• Automatic Generation of Symmetry-Breaking Constraints
• Recent Advances in Constraints