A survey of very large-scale neighborhood search techniques
暂无分享,去创建一个
Abraham P. Punnen | Ravindra K. Ahuja | James B. Orlin | Özlem Ergun | J. Orlin | R. Ahuja | Özlem Ergun | A. Punnen | Abraham P. Punnen | Özlem Ergun
[1] R. K. Wood,et al. Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" , 1996, SIAM J. Comput..
[2] Robert Weismantel,et al. A Primal Analogue of Cutting Plane , 1999 .
[3] King-Tim Mak,et al. A modified Lin-Kernighan traveling-salesman heuristic , 1993, Oper. Res. Lett..
[4] Charles M. Fiduccia,et al. A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.
[5] S. S. Sengupta,et al. The traveling salesman problem , 1961 .
[6] Brian W. Kernighan,et al. A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[7] Paul M. Thompson,et al. Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..
[8] G. M. Gutin. On an approach to solving the traveling salesman problem , 1984 .
[9] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[10] Abraham P. Punnen,et al. Domination analysis of some heuristics for the traveling salesman problem , 2002, Discret. Appl. Math..
[11] Fred W. Glover,et al. An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..
[12] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .
[13] Kevin D. Wayne,et al. A polynomial combinatorial algorithm for generalized minimum cost flow , 1999, STOC '99.
[14] Gerhard J. Woeginger,et al. The Travelling Salesman and the PQ-Tree , 1996, IPCO.
[15] Moshe Dror,et al. A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing , 1986, Comput. Oper. Res..
[16] Gérard Cornuéjols,et al. Halin graphs and the travelling salesman problem , 1983, Math. Program..
[17] Jeffrey Mark Phillips,et al. A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph , 1998, Inf. Process. Lett..
[18] R. Fahrion,et al. On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP) , 1990 .
[19] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[20] Jacques Carlier,et al. A new heuristic for the traveling Salesman problem , 1990 .
[21] Richard M. Karp,et al. A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..
[22] Abraham P. Punnen. The traveling salesman problem: new polynomial approximation algorithms and domination analysis , 2001 .
[23] Jeffrey L. Rummel,et al. A Subpath Ejection Method for the Vehicle Routing Problem , 1998 .
[24] Chris N. Potts,et al. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..
[25] Gerhard J. Woeginger,et al. A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem , 2000, Math. Program..
[26] J. P. Kelly,et al. Tabu search for the multilevel generalized assignment problem , 1995 .
[27] Nobuji Saito,et al. Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.
[28] D. Bertsekas. Network Flows and Monotropic Optimization (R. T. Rockafellar) , 1985 .
[29] Gregory Gutin,et al. Exponential neighbourhood local search for the traveling salesman problem , 1999, Comput. Oper. Res..
[30] Fred Glover,et al. TSP Ejection Chains , 1997, Discret. Appl. Math..
[31] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[32] Gerhard J. Woeginger,et al. The Travelling Salesman and the PQ-Tree , 1998, Math. Oper. Res..
[33] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[34] Gregory Gutin,et al. Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour , 1999, Comput. Oper. Res..
[35] Fred W. Glover,et al. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..
[36] David S. Johnson,et al. Local Optimization and the Traveling Salesman Problem , 1990, ICALP.
[37] T. Ibaraki,et al. A Variable Depth Search Algorithm for the Generalized Assignment Problem , 1999 .
[38] Charles J. Colbourn,et al. Optimum Communication Spanning Trees in Series-Parallel Networks , 1985, SIAM J. Comput..
[39] Fred W. Glover,et al. Construction Heuristics and Domination Analysis for the Asymmetric TSP , 1999, WAE.
[40] Abraham P. Punnen,et al. The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms , 1997 .
[41] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[42] Erwin Pesch,et al. Fast Clustering Algorithms , 1994, INFORMS J. Comput..
[43] Anders Yeo,et al. Large Exponential Neighbourhoods for the Traveling Salesman Problem , 1997 .
[44] James B. Orlin,et al. Theory of cyclic transfers , 1989 .
[45] Appajosyula Satyanarayana,et al. A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..
[46] Kevin D. Wayne. A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow , 2002, Math. Oper. Res..
[47] Catherine Roucairol,et al. A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .
[48] Fred W. Glover,et al. Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move , 1996, J. Heuristics.
[49] Lie-Fern Hsu,et al. Bottleneck assignment problems under categorization , 1986, Comput. Oper. Res..
[50] Manuel Duque-Antón. Constructing Efficient Simulated Annealing Algorithms , 1997, Discret. Appl. Math..
[51] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[52] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[53] Gregory Gutin,et al. Polynomial algorithms for the TSP and the QAP with a factorial domination number , 1998 .
[54] Kathryn A. Dowsland,et al. Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..
[55] I H Osman,et al. Meta-Heuristics Theory and Applications , 2011 .
[56] Gregory Gutin,et al. TSP tour domination and Hamilton cycle decompositions of regular digraphs , 2001, Oper. Res. Lett..
[57] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[58] E. Lawler,et al. Well-solved special cases , 1985 .
[59] Chris N. Potts,et al. Dynasearch - interative local improvement by dynamic programming: Part I, The traveling salesman problem , 1995 .
[60] Michael Thompson Paul. Local search algorithms for vehicle routing and other combinatorial problems , 1988 .
[61] Sigrid Knust,et al. Optimality Conditions and Exact Neighborhoods for Sequencing Problems , 1997 .
[62] Martin Zachariasen,et al. Tabu Search on the Geometric Traveling Salesman Problem , 1996 .
[63] Pawel Winter. Steiner problem in Halin networks , 1987, Discret. Appl. Math..
[64] Francis Sourd. Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures , 2001, J. Heuristics.
[65] Maria Grazia Scutellà,et al. Multi-exchange algorithms for the minimum makespan machinescheduling problem , 1999 .
[66] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[67] Kalyan T. Talluri. Swapping Applications in a Daily Airline Fleet Assignment , 1996, Transp. Sci..
[68] César Rego,et al. Relaxed tours and path ejections for the traveling salesman problem , 1998, Eur. J. Oper. Res..
[69] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.
[70] Dushyant Sharma,et al. New neighborhood search structures for the capacitated minimum spanning tree problem , 1998 .
[71] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[72] G. Reinelt. The Traveling Salesman Problem: Computational Solutions for TSP Applications, Lecture Notes , 1994 .
[73] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[74] Gregory Gutin,et al. TSP heuristics with large domination number , 1998 .
[75] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .
[76] Gregory Gutin,et al. Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number , 2002, Discret. Appl. Math..
[77] James B. Orlin,et al. A Scaling Algorithm for Multicommodity Flow Problems , 2018, Oper. Res..
[78] Egon Balas,et al. Implementation of a Linear Time Algorithm for Certain Generalized Traveling Salesman Problems , 1996, IPCO.
[79] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[80] Éric D. Taillard,et al. Heuristic Methods for Large Centroid Clustering Problems , 2003, J. Heuristics.
[81] Herbert S. Wilf,et al. Algorithms and Complexity , 1994, Lecture Notes in Computer Science.
[82] J. Hurink. An exponential neighborhood for a one-machine batching problem , 1999 .
[83] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..