Small covering designs by branch-and-cut

DOI10.1007/S10107-002-0316-ZzbMath1030.90144OpenAlexW1979266797MaRDI QIDQ1411610

Margot, François

Publication date: 29 October 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-002-0316-z

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of block designs (05B05) Applications of design theory to circuits and networks (94C30)

Related Items (19)

Symmetry in Mathematical Programming ⋮ Polytopes associated with symmetry handling ⋮ Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays ⋮ Constraint Orbital Branching ⋮ Orbitopal fixing ⋮ Orbital branching ⋮ A tabu search algorithm for the covering design problem ⋮ Packing and partitioning orbitopes ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ A note on a symmetrical set covering problem: the lottery problem ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Classification of orthogonal arrays by integer programming ⋮ The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program ⋮ Integer Programming for Classifying Orthogonal Arrays ⋮ Unnamed Item ⋮ Variable neighborhood descent heuristic for covering design problem ⋮ Automatic Generation of Symmetry-Breaking Constraints ⋮ Political districting to minimize cut edges ⋮ Algorithms for finding generalized minimum aberration designs

This page was built for publication: Small covering designs by branch-and-cut