Orbital shrinking: theory and applications

DOI10.1016/J.DAM.2017.01.015zbMATH Open1406.90081OpenAlexW2288699621MaRDI QIDQ1786877FDOQ1786877

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

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

zbMATH Keywords

symmetrymathematical programmingconstraint programmingrelaxationdiscrete optimizationMINLP

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

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

Cited In (3)

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

Uses Software

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

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)