Orbital shrinking: theory and applications
From MaRDI portal
Publication:1786877
DOI10.1016/j.dam.2017.01.015zbMath1406.90081OpenAlexW2288699621MaRDI QIDQ1786877
Toby Walsh, Domenico Salvagnin, Leo Liberti, Matteo Fischetti
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
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- A large neighbourhood search approach to the multi-activity shift scheduling problem
- An exact algorithm for large multiple knapsack problems
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Pruning by isomorphism in branch-and-cut
- Logic-based Benders decomposition
- Exploiting orbits in symmetric ILP
- Where are the hard knapsack problems?
- Symmetry groups, semidefinite programs, and sums of squares
- Algorithms for highly symmetric linear and integer programs
- Solving large Steiner Triple Covering Problems
- Formal languages for integer programming modeling of shift scheduling problems
- Exploiting symmetry in integer convex optimization using core points
- On solving a hard quadratic 3-dimensional assignment problem
- Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
- Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
- Orbital Shrinking
- A Linear Programming Approach to the Cutting-Stock Problem
- Branching and bounds tighteningtechniques for non-convex MINLP
- Constraint Orbital Branching
- Decomposing Global Grammar Constraints
- Symmetry Definitions for Constraint Satisfaction Problems
- Automatic Detection of Variable and Value Symmetries
- Symmetry in Integer Linear Programming
- The Polytope of Context-Free Grammar Constraints
- Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
- Symmetry and Satisfiability: An Update
- Automatic Generation of Symmetry-Breaking Constraints
- Algorithms in invariant theory
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
