Orbital Shrinking

DOI10.1007/978-3-642-32147-4_6zbMath1370.90209OpenAlexW2913028735MaRDI QIDQ3167611

Matteo Fischetti, Leo Liberti

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_6

zbMATH Keywords

symmetryrelaxationmathematical programmingdiscrete optimizationalgebraMILPconvex MINLP

Mathematics Subject Classification ID

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

Related Items

An implicit model for multi-activity shift scheduling problems, Exploiting symmetries in mathematical programming via orbital independence, Equivalence of Lattice Orbit Polytopes, Polytopes associated with symmetry handling, A computational comparison of symmetry handling methods for mixed integer programs, Orbital shrinking: theory and applications, On solving a hard quadratic 3-dimensional assignment problem