Improving Discrete Model Representations via Symmetry Considerations

Authors:
Hanif D. Sherali;J. Cole Smith
Affiliations:
-;-
Venue:
Management Science
Year:
2001

Citing 0
Cited 30

Symmetry Breaking

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Accelerating Branch-and-Bound through a Modeling Language Construct for Relaxation-Specific Constraints

Journal of Global Optimization
A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

Journal of Global Optimization
The task assignment problem for unrestricted movement between workstation groups

Journal of Scheduling
A ring-mesh topology design problem for optical transport networks

Journal of Heuristics
Stochastic programming for nurse assignment

Computational Optimization and Applications
Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers

Informatica
Orbital Branching

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Automatic Generation of Symmetry-Breaking Constraints

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Branch-and-price-and-cut algorithms for solving the reliable h-paths problem

Journal of Global Optimization
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing

INFORMS Journal on Computing
Constraint orbital branching

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
A traffic grooming problem considering hub location for synchronous optical network-wavelength division multiplexing networks

Computers and Industrial Engineering
Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty

Operations Research
A reactive GRASP with path relinking for capacitated clustering

Journal of Heuristics
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty

INFORMS Journal on Computing
An adaptive multi-start graph partitioning algorithm for structuring cellular networks

Journal of Heuristics
Two branch-and-bound algorithms for the robust parallel machine scheduling problem

Computers and Operations Research
An efficient integer programming formulation for the assignment of base stations to controllers in cellular networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Symmetry and search in a network design problem

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Transforming and refining abstract constraint specifications

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Boosting set constraint propagation for network design

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cutting plane algorithms for solving a stochastic edge-partition problem

Discrete Optimization
A Branch and Price algorithm for the k-splittable maximum flow problem

Discrete Optimization
Intermediate integer programming representations using value disjunctions

Discrete Optimization
Orbital shrinking

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Using symmetry to optimize over the sherali-adams relaxation

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Operating Room Pooling and Parallel Surgery Processing Under Uncertainty

INFORMS Journal on Computing
Efficient symmetry breaking formulations for the job grouping problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we focus on a useful modeling concept that is frequently ignored while formu lating discrete optimization problems. Very often, there exists a natural symmetry inherent in the problem itself that, if propagated to the model, can hopelessly mire a branch-and-bound solver by burdening it to explore and eliminate such alternative symmetric solutions. We discuss three applications where such a symmetry arises: a telecommunications network design problem, a noise pollution problem, and a machine procurement and operation problem. For each case, we identify the indistinguishable objects in the model that create the problem symmetry and show how imposing certain decision hierarchies within the model significantly enhances its solvability, while using a popular modern-day commercial branch-and-cut software (CPLEX 6.5).