Fundamental Domains for Integer Programs with Symmetries
暂无分享,去创建一个
[1] Isabel Méndez-Díaz,et al. A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..
[2] François Margot,et al. Small covering designs by branch-and-cut , 2003, Math. Program..
[3] Jeff T. Linderoth,et al. Orbital Branching , 2007, IPCO.
[4] François Margot,et al. Pruning by isomorphism in branch-and-cut , 2001, Math. Program..
[5] Michael M. Sørensen,et al. The optimal graph partitioning problem , 1993 .
[6] V. Kaibel,et al. Packing and partitioning orbitopes , 2006, math/0603678.
[7] Martin W. P. Savelsbergh,et al. Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..
[8] Walter Ukovich,et al. A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..
[9] M. Bazaraa,et al. A branch-and-bound-based heuristic for solving the quadratic assignment problem , 1983 .
[10] Marc E. Pfetsch,et al. Orbitopal Fixing , 2007, IPCO.