Eliminating redundant solutions of some symmetric combinatorial integer programs

Electronic Notes in Discrete Mathematics

Volumn 18, Issue , 2004, Pages 201-206

  Rey, Pablo A ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

Integer programming; redundant solutions; symmetry

Indexed keywords

EID: 34247102372     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2004.06.032     Document Type: Article

References (6)

1. Fulkerson D., Nemhauser G., and Trotter Jr.L. Two computational difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. Mathematical Programming Study 2 (1974) 72-81
2. Jeroslow R.G. Trivial integer programs unsolvable by branch-and-bound. Mathematical Programming 6 (1974) 104-109
3. Margot F. Prunning by isomorphism in branch-and-cut. Mathematical Programming 94 (2002) 71-90
4. Margot F. Small covering designs by branch-and-cut. Mathematical Programming (Ser. B) 94 (2003) 207-220
5. Margot F. Exploiting orbits in symmetric ILP. Mathematical Programming (Ser. B) 98 (2003) 3-21
6. Sherali H., and Cole Smith J. Improving discrete model representations via symmetry considerations. Management Science 47 (2001) 1396-1407