Efficient symmetry breaking formulations for the job grouping problem
From MaRDI portal
(Redirected from Publication:340336)
Recommendations
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- Symmetry breaking inequalities from the Schreier-Sims table
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Three perspectives for solving the job grouping problem
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
Cited in
(10)- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
- Enhancing Benders decomposition algorithm to solve a combat logistics problem
- Tool-feeder partitions for module assignment in PCB assembly
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- Memetic collaborative approaches for finding balanced incomplete block designs
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- The pickup and delivery problem with time windows and occasional drivers
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Classification, models and exact algorithms for multi-compartment delivery problems
This page was built for publication: Efficient symmetry breaking formulations for the job grouping problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340336)