Formulation and Solution of the Target Visitation Problem
暂无分享,去创建一个
[1] Gerhard Reinelt,et al. A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..
[2] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .
[3] J. Mitchell,et al. Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm , 2000 .
[4] Mauricio G. C. Resende,et al. Grasp: An Annotated Bibliography , 2002 .
[5] Lucia I. P. Resende. New expression for the extended Δ-Y reductions , 1989 .
[6] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[7] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[8] Stefan Chanas,et al. A new heuristic algorithm solving the linear ordering problem , 1996, Comput. Optim. Appl..
[9] John E. Mitchell,et al. Computational Experience with an Interior Point Cutting Plane Algorithm , 1999, SIAM J. Optim..
[10] Fred W. Glover,et al. An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..
[11] Celso C. Ribeiro,et al. Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.
[12] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[13] Kendall E. Nygard,et al. An Integer Programming Model for Assigning Unmanned Air Vehicles to Tasks , 2004 .
[14] Hollis B. Chenery,et al. International Comparisons of the Structure of Production , 1958 .
[15] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[16] Marios M. Polycarpou,et al. Multi-Target Assignment and Path Planning for Groups of UAVs , 2004 .
[17] P. McMullen. THE LINEAR ORDERING PROBLEM: ALGORITHMS AND APPLICATIONS (Research and Exposition in Mathematics 8) , 1987 .