메뉴 건너뛰기




Volumn 3524, Issue , 2005, Pages 19-33

Set variables and local search

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

EID: 26444521706     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_4     Document Type: Conference Paper
Times cited : (3)

References (25)
  • 3
    • 84956988187 scopus 로고    scopus 로고
    • Solving the Kirkman's schoolgirl problem in a few seconds
    • Proc. of CP'02. Springer
    • N. Barnier and P. Brisset. Solving the Kirkman's schoolgirl problem in a few seconds. In Proc. of CP'02, volume 2470 of LNCS, pages 477-491. Springer, 2002.
    • (2002) LNCS , vol.2470 , pp. 477-491
    • Barnier, N.1    Brisset, P.2
  • 4
    • 84945980778 scopus 로고    scopus 로고
    • Global constraints as graph properties on a structured network of elementary constraints of the same type
    • Proc. of CP'00. Springer-Verlag
    • N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Proc. of CP'00, volume 1894 of LNCS, pages 52-66. Springer-Verlag, 2000.
    • (2000) LNCS , vol.1894 , pp. 52-66
    • Beldiceanu, N.1
  • 5
    • 35048892497 scopus 로고    scopus 로고
    • Cost evaluation of soft global constraints
    • Proc. of CPAIOR'04. Springer-Verlag
    • N. Beldiceanu and T. Petit. Cost evaluation of soft global constraints. In Proc. of CPAIOR'04, volume 3011 of LNCS, pages 80-95. Springer-Verlag, 2004.
    • (2004) LNCS , vol.3011 , pp. 80-95
    • Beldiceanu, N.1    Petit, T.2
  • 7
    • 84937389766 scopus 로고    scopus 로고
    • Yet another local search method for constraint solving
    • Proc. of SAGA'01. Springer-Verlag
    • P. Codognet and D. Diaz. Yet another local search method for constraint solving. In Proc. of SAGA'01, volume 2264 of LNCS, pages 73-90. Springer-Verlag, 2001.
    • (2001) LNCS , vol.2264 , pp. 73-90
    • Codognet, P.1    Diaz, D.2
  • 8
    • 4244097066 scopus 로고
    • Problem at Schweitzer competition
    • K. Corrádi. Problem at Schweitzer competition. Mat. Lapok, 20:159-162, 1969.
    • (1969) Mat. Lapok , vol.20 , pp. 159-162
    • Corrádi, K.1
  • 9
    • 26444552167 scopus 로고    scopus 로고
    • Scheduling social golfers locally
    • Proc. of CPAIOR'05, Springer-Verlag
    • I. Dotú and P. Van Hentenryck. Scheduling social golfers locally. In Proc. of CPAIOR'05, LNCS, Springer-Verlag, 2005.
    • (2005) LNCS
    • Dotú, I.1    Van Hentenryck, P.2
  • 10
    • 26444525299 scopus 로고    scopus 로고
    • A general approach for constraint solving by local search
    • P. Galinier and J.-K. Hao. A general approach for constraint solving by local search. In Proc. of CP-AI-OR'00.
    • Proc. of CP-AI-OR'00
    • Galinier, P.1    Hao, J.-K.2
  • 11
    • 0012275569 scopus 로고    scopus 로고
    • Interval propagation to reason about sets: Definition and implementation of a practical language
    • C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3): 191-244, 1997.
    • (1997) Constraints , vol.1 , Issue.3 , pp. 191-244
    • Gervet, C.1
  • 12
    • 84948961741 scopus 로고    scopus 로고
    • Localizer: A modeling language for local search
    • Proc. of CP'97. Springer-Verlag
    • L. Michel and P. Van Hentenryck. Localizer: A modeling language for local search. In Proc. of CP'97, volume 1330 of LNCS. Springer-Verlag, 1997.
    • (1997) LNCS , vol.1330
    • Michel, L.1    Van Hentenryck, P.2
  • 13
    • 0038486673 scopus 로고    scopus 로고
    • A constraint-based architecture for local search
    • Proc. of OOPSLA'02
    • L. Michel and P. Van Hentenryck. A constraint-based architecture for local search. ACM SIGPLAN Notices, 37(11):101-110, 2002. Proc. of OOPSLA'02.
    • (2002) ACM SIGPLAN Notices , vol.37 , Issue.11 , pp. 101-110
    • Michel, L.1    Van Hentenryck, P.2
  • 14
    • 26444526552 scopus 로고    scopus 로고
    • Maintaining longest paths incrementally
    • Proc. of CP'03, Springer-Verlag
    • L. Michel and P. Van Hentenryck. Maintaining longest paths incrementally. In Proc. of CP'03, volume 2833 of LNCS, pages 540-554. Springer-Verlag, 2003.
    • (2003) LNCS , vol.2833 , pp. 540-554
    • Michel, L.1    Van Hentenryck, P.2
  • 16
    • 0037492463 scopus 로고    scopus 로고
    • Using global constraints for local search
    • Constraint Programming and Large Scale Discrete Optimization. AMS
    • A. Nareyek. Using global constraints for local search. In Constraint Programming and Large Scale Discrete Optimization, volume 57 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 9-28. AMS, 2001.
    • (2001) DIMACS: Series in Discrete Mathematics and Theoretical Computer Science , vol.57 , pp. 9-28
    • Nareyek, A.1
  • 17
    • 85088359050 scopus 로고    scopus 로고
    • Specific filtering algorithms for over constrained problems
    • Proc. of CP'01, Springer
    • T. Petit, J.-C. Régin, and C. Bessière. Specific filtering algorithms for over constrained problems. In Proc. of CP'01, volume 2293 of LNCS, Springer, 2001.
    • (2001) LNCS , vol.2293
    • Petit, T.1    Régin, J.-C.2    Bessière, C.3
  • 20
    • 84957002110 scopus 로고    scopus 로고
    • Symmetry breaking revisited
    • Proc. of CP'02, Springer-Verlag
    • J.-F. Puget. Symmetry breaking revisited. In Proc. of CP'02, volume 2470 of LNCS, pages 446-461. Springer-Verlag, 2002.
    • (2002) LNCS , vol.2470 , pp. 446-461
    • Puget, J.-F.1
  • 21
    • 0030232050 scopus 로고    scopus 로고
    • The progressive party problem: Integer linear programming and constraint programming compared
    • B. M. Smith et al. The progressive party problem: Integer linear programming and constraint programming compared. Constraints, 1:119-138, 1996.
    • (1996) Constraints , vol.1 , pp. 119-138
    • Smith, B.M.1
  • 23
    • 35248819594 scopus 로고    scopus 로고
    • Control abstractions for local search
    • Proc. of CP'03. Springer-Verlag
    • P. Van Hentenryck and L. Michel. Control abstractions for local search. In Proc. of CP'03, volume 2833 of LNCS, pages 65-80. Springer-Verlag, 2003.
    • (2003) LNCS , vol.2833 , pp. 65-80
    • Van Hentenryck, P.1    Michel, L.2
  • 24
    • 26444618477 scopus 로고    scopus 로고
    • Constraint-based combinators for local search
    • Proc. of CP'04, Springer-Verlag
    • P. Van Hentenryck, L. Michel, and L. Liu. Constraint-based combinators for local search. In Proc. of CP'04, volume 3258 of LNCS. Springer-Verlag, 2004.
    • (2004) LNCS , vol.3258
    • Van Hentenryck, P.1    Michel, L.2    Liu, L.3
  • 25
    • 14644390390 scopus 로고    scopus 로고
    • Integer optimization by local search: A domain-independent approach
    • Springer-Verlag
    • J. P. Walser. Integer Optimization by Local Search: A Domain-Independent Approach, volume 1637 of LNCS. Springer-Verlag, 1999.
    • (1999) LNCS , vol.1637
    • Walser, J.P.1


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