메뉴 건너뛰기




Volumn 3524, Issue , 2005, Pages 336-350

Symmetry and search in a network design problem

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

EID: 26444586059     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_25     Document Type: Conference Paper
Times cited : (15)

References (9)
  • 1
    • 0000386002 scopus 로고    scopus 로고
    • Increasing constraint propagation by redundant modeling: An experience report
    • B. M. W. Cheng, K. M. F. Choi, J. H. M. Lee, and J. C. K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4:167-192, 1999.
    • (1999) Constraints , vol.4 , pp. 167-192
    • Cheng, B.M.W.1    Choi, K.M.F.2    Lee, J.H.M.3    Wu, J.C.K.4
  • 2
    • 0031634747 scopus 로고    scopus 로고
    • On the computation of local interchangeability in discrete constraint satisfaction problems
    • B. Y. Choueiry and G. Noubir. On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In AAAI-98, pages 326-333, 1998.
    • (1998) AAAI-98 , pp. 326-333
    • Choueiry, B.Y.1    Noubir, G.2
  • 5
    • 0003084962 scopus 로고    scopus 로고
    • Symmetry breaking during search in constraint programming
    • W. Horn, editor
    • I. P. Gent and B. M. Smith. Symmetry Breaking During Search in Constraint Programming. In W. Horn, editor, Proceedings ECAI'2000, pages 599-603, 2000.
    • (2000) Proceedings ECAI'2000 , pp. 599-603
    • Gent, I.P.1    Smith, B.M.2
  • 6
    • 35248817260 scopus 로고    scopus 로고
    • Using constraint programming to solve the maximum clique problem
    • F. Rossi, editor, LNCS. Springer
    • J.-C. Régin. Using Constraint Programming to Solve the Maximum Clique Problem. In F. Rossi, editor, Principles and Practice of Constraint Programming - CP 2003, LNCS 2833, pages 634-648. Springer, 2003.
    • (2003) Principles and Practice of Constraint Programming - CP 2003 , vol.2833 , pp. 634-648
    • Régin, J.-C.1
  • 7
    • 0035494147 scopus 로고    scopus 로고
    • Improving discrete model representations via symmetry considerations
    • H. D. Sherali and J. C. Smith. Improving Discrete Model Representations Via Symmetry Considerations. Management Science, 47:1396-1407, 2001.
    • (2001) Management Science , vol.47 , pp. 1396-1407
    • Sherali, H.D.1    Smith, J.C.2
  • 8
    • 0037558446 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem allowing demand splitting
    • H. D. Sherali, J. C. Smith, and Y. Lee. A branch-and-cut algorithm for solving an intra-ring synchronous optical network design problem allowing demand splitting. INFORMS J. on Computing, 12:284-298, 2000.
    • (2000) INFORMS J. on Computing , vol.12 , pp. 284-298
    • Sherali, H.D.1    Smith, J.C.2    Lee, Y.3


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