Local Search and Constraint Programming
暂无分享,去创建一个
[1] Mauro Dell'Amico,et al. Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..
[2] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[4] François Laburthe,et al. Heuristics for Large Constrained Vehicle Routing Problems , 1999, J. Heuristics.
[5] Bruce L. Golden,et al. VEHICLE ROUTING: METHODS AND STUDIES , 1988 .
[6] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[7] Andrea Lodi,et al. Soving TSP with Time Windows with Constraints , 1999, ICLP.
[8] Robert A. Russell,et al. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..
[9] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[10] Nicolas Beldiceanu,et al. Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.
[11] Toby Walsh. Depth-bounded Discrepancy Search , 1997, IJCAI.
[12] Wim Nuijten,et al. Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.
[13] Daniele Vigo,et al. An introduction to Constraint Programming , 1999 .
[14] François Laburthe,et al. A Meta-Heuristic Factory for Vehicle Routing Problems , 1999, CP.
[15] Matteo Fischetti,et al. Algorithms for railway crew management , 1997, Math. Program..
[16] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[17] Joachim P. Walser. Integer Optimization by Local Search , 2000, Lecture Notes in Computer Science.
[18] Patrick Prosser,et al. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics , 2000, J. Heuristics.
[19] Steven David Prestwich. A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences , 2000, CP.
[20] Reha Uzsoy,et al. Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems , 2000, J. Heuristics.
[21] Jean-Charles Régin,et al. A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.
[22] Pascal Van Hentenryck,et al. Localizer: A Modeling Language for Local Search , 1997, CP.
[23] Michel Gendreau,et al. An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows , 1998, Transp. Sci..
[24] Stephen F. Smith,et al. A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.
[25] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[26] Michel Gendreau,et al. A Constraint Programming Framework for Local Search Methods , 1999, J. Heuristics.
[27] Andrea Lodi,et al. Cost-Based Domain Filtering , 1999, CP.
[28] W. D. Harvey,et al. Nonsystematic backtracking search , 1995 .
[29] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[30] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .
[31] Michel Gendreau,et al. GENIUS-CP: a Generic Single-Vehicle Routing Algorithm , 1997, CP.
[32] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[33] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[34] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[35] Paolo Toth,et al. Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..
[36] Pascal Van Hentenryck,et al. Design, Implementation, and Evaluation of the Constraint Language cc(FD) , 1994, Constraint Programming.
[37] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[38] Michel Gendreau,et al. A View of Local Search in Constraint Programming , 1996, CP.
[39] Ulrich Junker,et al. Preference-Based Search for Scheduling , 2000, AAAI/IAAI.
[40] Edward P. K. Tsang,et al. Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..
[41] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[42] Celso C. Ribeiro,et al. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..
[43] Danny De Schreye. Logic programming : proceedings of the 1999 International Conference on Logic Programming , 1999 .
[44] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[45] Claude Le Pape,et al. Constraint-Based Job Shop Scheduling with IILOG SCHEDULER , 1998, J. Heuristics.
[46] Gilbert Laporte,et al. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..
[47] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[48] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..