메뉴 건너뛰기




Volumn 2833, Issue , 2003, Pages 65-80

Control abstractions for local search

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SOFTWARE REUSABILITY; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION); OBJECT ORIENTED PROGRAMMING;

EID: 35248819594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_5     Document Type: Article
Times cited : (19)

References (26)
  • 1
    • 0031997369 scopus 로고    scopus 로고
    • Guided local search with shifting bottleneck for job-shop scheduling
    • E. Balas and A. Vazacopoulos. Guided local search with shifting bottleneck for job-shop scheduling. Management Science, 44(2), 1998.
    • (1998) Management Science , vol.44 , Issue.2
    • Balas, E.1    Vazacopoulos, A.2
  • 2
    • 0142006512 scopus 로고    scopus 로고
    • A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
    • To Appear
    • R. Bent and P. Van Hentenryck. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science, 2001. (To Appear).
    • (2001) Transportation Science
    • Bent, R.1    Van Hentenryck, P.2
  • 4
    • 0034272145 scopus 로고    scopus 로고
    • Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
    • B. De Backer et al. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics, 6:501-523, 2000.
    • (2000) Journal of Heuristics , vol.6 , pp. 501-523
    • De Backer, B.1
  • 5
    • 34250074609 scopus 로고
    • Applying Tabu Search to the Job-Shop Scheduling Problem
    • M. Dell'Amico and M. Trubian. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252, 1993.
    • (1993) Annals of Operations Research , vol.41 , pp. 231-252
    • Dell'Amico, M.1    Trubian, M.2
  • 7
    • 0141971869 scopus 로고    scopus 로고
    • A General Approach for Constraint Solving by Local Search
    • Paderborn, Germany, March
    • P. Galinier and J.-K. Hao. A General Approach for Constraint Solving by Local Search. In CP-AI-OR'00, Paderborn, Germany, March 2000.
    • (2000) CP-AI-OR'00
    • Galinier, P.1    Hao, J.-K.2
  • 8
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, 1970.
    • (1970) Bell System Technical Journal , vol.49 , pp. 291-307
    • Kernighan, B.1    Lin, S.2
  • 11
    • 0006830055 scopus 로고    scopus 로고
    • SALSA: A Language for Search Algorithms
    • F. Laburthe and Y. Caseau. SALSA: A Language for Search Algorithms. In CP'98.
    • CP'98
    • Laburthe, F.1    Caseau, Y.2
  • 12
    • 0037810320 scopus 로고    scopus 로고
    • Workflow Enactment with Continuation and Future Objects
    • Seattle, WA
    • D. Manolescu. Workflow Enactment with Continuation and Future Objects. In OOPLSA'02, Seattle, WA, 2002.
    • (2002) OOPLSA'02
    • Manolescu, D.1
  • 13
    • 0038486673 scopus 로고    scopus 로고
    • A Constraint-Based Architecture for Local Search
    • Seattle, WA
    • L. Michel and P. Van Hentenryck. A Constraint-Based Architecture for Local Search. In OOPLSA'02, Seattle, WA, 2002.
    • (2002) OOPLSA'02
    • Michel, L.1    Van Hentenryck, P.2
  • 16
    • 0002869126 scopus 로고    scopus 로고
    • Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method
    • S. Minton, M. Johnston, and A. Philips. Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In AAAI-90.
    • AAAI-90
    • Minton, S.1    Johnston, M.2    Philips, A.3
  • 18
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797-813, 1996.
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 19
    • 0040267583 scopus 로고    scopus 로고
    • Search Procedures and Parallelism in Constraint Programming
    • Alexandra, VA
    • L. Perron. Search Procedures and Parallelism in Constraint Programming. In CP'99, Alexandra, VA, 1999.
    • (1999) CP'99
    • Perron, L.1
  • 22
    • 35248848627 scopus 로고    scopus 로고
    • Comparing trailing and copying for constraint programming
    • C. Schulte. Comparing trailing and copying for constraint programming. In ICLP'99.
    • ICLP'99
    • Schulte, C.1


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