Orbital shrinking: theory and applications
type: Item
instance of: scholarly article
title: Orbital shrinking: theory and applications
zbMATH Open document ID: 1406.90081
author: Matteo Fischetti
author: Leo Liberti
author: Domenico Salvagnin
author: Toby Walsh
published in: Discrete Applied Mathematics
publication date: 2018-09-25T00:00:00Z
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6943439
zbMATH Keywords: mathematical programming
zbMATH Keywords: constraint programming
zbMATH Keywords: discrete optimization
zbMATH Keywords: symmetry
zbMATH Keywords: relaxation
zbMATH Keywords: MINLP
describes a project that uses: nauty
describes a project that uses: MIPLIB
describes a project that uses: CPLEX
describes a project that uses: Knapsack
describes a project that uses: MULKNAP
describes a project that uses: Gecode
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: j.dam.2017.01.015
OpenAlex ID: W2288699621
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Algorithms for highly symmetric linear and integer programs
cites work: Symmetry Definitions for Constraint Satisfaction Problems
cites work: Formal languages for integer programming modeling of shift scheduling problems
cites work: Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
cites work: Orbital Shrinking
cites work: Symmetry groups, semidefinite programs, and sums of squares
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Exploiting symmetry in integer convex optimization using core points
cites work: Logic-based Benders decomposition
cites work: Q3862379
cites work: Symmetry and Satisfiability: An Update
cites work: Automatic Generation of Symmetry-Breaking Constraints
cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation
cites work: Stabilizer-based symmetry breaking constraints for mathematical programs
cites work: Improving bounds on the football pool problem by integer programming and high-throughput computing
cites work: Pruning by isomorphism in branch-and-cut
cites work: Exploiting orbits in symmetric ILP
cites work: Symmetry in Integer Linear Programming
cites work: Q3993418
cites work: Q3671211
cites work: On solving a hard quadratic 3-dimensional assignment problem
cites work: Constraint Orbital Branching
cites work: Orbital branching
cites work: Solving large Steiner Triple Covering Problems
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: The Polytope of Context-Free Grammar Constraints
cites work: An exact algorithm for large multiple knapsack problems
cites work: Where are the hard knapsack problems?
cites work: Automatic Detection of Variable and Value Symmetries
cites work: A large neighbourhood search approach to the multi-activity shift scheduling problem
cites work: Decomposing Global Grammar Constraints
cites work: Q3184605
cites work: Q4540930
cites work: Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: Algorithms in invariant theory
DOI: 10.1016/J.DAM.2017.01.015
description: scientific article; zbMATH DE number 6943439