메뉴 건너뛰기




Volumn 2, Issue 4, 2005, Pages 308-319

Linear optimization over permutation groups

Author keywords

Fixed point minimization; Hamming distance; Permutation groups

Indexed keywords

ALGORITHMS; LINEAR SYSTEMS; PROBLEM SOLVING;

EID: 27744550474     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.08.005     Document Type: Article
Times cited : (7)

References (14)
  • 1
    • 0007031047 scopus 로고    scopus 로고
    • Fast management of permutation groups i
    • L. Babai, E.M. Luks, and Á. Seress Fast management of permutation groups I SIAM J. Comput. 26 5 1997 1310 1342
    • (1997) SIAM J. Comput. , vol.26 , Issue.5 , pp. 1310-1342
    • Babai, L.1    Luks, E.M.2    Seress, Á.3
  • 2
    • 0016116546 scopus 로고
    • On the assignment polytope
    • M. Balinski, and A. Russakoff On the assignment polytope SIAM Rev. 16 1974 516 525
    • (1974) SIAM Rev. , vol.16 , pp. 516-525
    • Balinski, M.1    Russakoff, A.2
  • 3
    • 0007468927 scopus 로고
    • Combinatorial complexity of orbits in representations of the symmetric group
    • A.I. Barvinok Combinatorial complexity of orbits in representations of the symmetric group Adv. Sov. Math. 9 1992 161 182
    • (1992) Adv. Sov. Math. , vol.9 , pp. 161-182
    • Barvinok, A.I.1
  • 5
    • 18244366958 scopus 로고    scopus 로고
    • Detecting symmetries by branch & cut
    • C. Buchheim, and M. Jünger Detecting symmetries by branch & cut Math. Prog. Ser. B 98 2003 369 384
    • (2003) Math. Prog. Ser. B , vol.98 , pp. 369-384
    • Buchheim, C.1    Jünger, M.2
  • 8
    • 0342571667 scopus 로고    scopus 로고
    • The ABACUS system for branch-and-cut-and-price-algorithms in integer programming and combinatorial optimization
    • M. Jünger, and S. Thienel The ABACUS system for branch-and-cut-and- price-algorithms in integer programming and combinatorial optimization Softw. Pract. Exper. 30 11 2000 1325 1352
    • (2000) Softw. Pract. Exper. , vol.30 , Issue.11 , pp. 1325-1352
    • Jünger, M.1    Thienel, S.2
  • 9
    • 0042627207 scopus 로고
    • Some NP-complete problems similar to graph isomorphism
    • A. Lubiw Some NP-complete problems similar to graph isomorphism SIAM J. Comput. 10 1 1981 11 21
    • (1981) SIAM J. Comput. , vol.10 , Issue.1 , pp. 11-21
    • Lubiw, A.1
  • 10
    • 2942657073 scopus 로고    scopus 로고
    • Exploiting orbits in symmetric ILP
    • F. Margot Exploiting orbits in symmetric ILP Math. Prog. Ser. B 98 2003 3 21
    • (2003) Math. Prog. Ser. B , vol.98 , pp. 3-21
    • Margot, F.1
  • 12
    • 0004010079 scopus 로고
    • Nauty user's guide (version 1.5)
    • Computer Science Department, Australian National University
    • B.D. McKay, nauty user's guide (version 1.5). Technical Report TR-CS-90-02, Computer Science Department, Australian National University, 1990.
    • (1990) Technical Report , vol.TR-CS-90-02
    • McKay, B.D.1
  • 14
    • 27744456965 scopus 로고    scopus 로고
    • CPLEX 8.1. www.ilog.com/products/cplex, 2000.
    • (2000) CPLEX 8.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.