Orbital shrinking: theory and applications

DOI10.1016/J.DAM.2017.01.015MaRDI QIDQ1786877zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh

Publication date 25 September 2018

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2017.01.015

zbMATH Keywords

symmetrymathematical programmingconstraint programmingrelaxationdiscrete optimizationMINLP

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
• Orbital shrinking
• Orbital branching
• Orbital Branching
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem

Cites work

• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1772585 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• Algorithms for highly symmetric linear and integer programs
• Algorithms in invariant theory
• An exact algorithm for large multiple knapsack problems
• Automatic Detection of Variable and Value Symmetries
• Automatic Generation of Symmetry-Breaking Constraints
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• Constraint Orbital Branching
• Decomposing Global Grammar Constraints
• Exploiting orbits in symmetric ILP
• Exploiting symmetry in integer convex optimization using core points
• Formal languages for integer programming modeling of shift scheduling problems
• Grammar-based integer programming models for multiactivity shift scheduling
• Handbook of constraint programming.
• Improving bounds on the football pool problem by integer programming and high-throughput computing
• Logic-based Benders decomposition
• On solving a hard quadratic 3-dimensional assignment problem
• Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
• Orbital branching
• Orbital shrinking
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Pruning by isomorphism in branch-and-cut
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Solving large Steiner Triple Covering Problems
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Symmetry Definitions for Constraint Satisfaction Problems
• Symmetry and Satisfiability: An Update
• Symmetry groups, semidefinite programs, and sums of squares
• Symmetry in integer linear programming
• The Polytope of Context-Free Grammar Constraints
• Where are the hard knapsack problems?

Cited in

(3)

• Exploiting symmetries in mathematical programming via orbital independence
• Orbital shrinking
• Applications of Thin Orbits

Describes a project that uses

Uses Software

• Bison
• MULKNAP
• Gecode
• Knapsack
• CPLEX
• MIPLIB
• nauty

This page was built for publication: Orbital shrinking: theory and applications

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