Efficient symmetry breaking formulations for the job grouping problem

DOI10.1016/j.cor.2012.11.017zbMath1349.90646OpenAlexW2049188596MaRDI QIDQ340336

Raf Jans, Jacques Desrosiers

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.11.017

zbMATH Keywords

symmetry breakingmixed integer programming formulationsclustering problemsjob grouping

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Theory of organizations, manpower planning in operations research (90B70)

Related Items (9)

Classification, models and exact algorithms for multi-compartment delivery problems ⋮ Tool-feeder partitions for module assignment in PCB assembly ⋮ Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Enhancing Benders decomposition algorithm to solve a combat logistics problem ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope ⋮ The pickup and delivery problem with time windows and occasional drivers ⋮ Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking ⋮ Memetic collaborative approaches for finding balanced incomplete block designs

This page was built for publication: Efficient symmetry breaking formulations for the job grouping problem