Regional Search for the Resource Constrained Assignment Problem
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..
[2] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[3] Markus Reuther. Local Search for the Resource Constrained Assignment Problem , 2014, ATMOS.
[4] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[5] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[6] Irina Dumitrescu,et al. Constrained path and cycle problems , 2002 .
[7] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..
[8] Luigi Di Puglia Pugliese,et al. A survey of resource constrained shortest path problems: Exact solution approaches , 2013, Networks.
[9] Y. Shiloach. The two paths problem is polynomial , 1978 .
[10] R. Gomory,et al. A Primal Method for the Assignment and Transportation Problems , 1964 .
[11] Paolo Toth,et al. Vehicle Routing , 2014, Vehicle Routing.
[12] Gerard Sierksma,et al. Tolerance-based Branch and Bound algorithms for the ATSP , 2008, Eur. J. Oper. Res..
[13] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[14] Marcus Poggi de Aragão,et al. Improved Branch-Cut-and-Price for Capacitated Vehicle Routing , 2014, IPCO.
[15] Timo Berthold. RENS: The optimal rounding , 2014 .
[16] M. Fischetti,et al. A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs , 1994, Oper. Res..
[17] M. Balinski,et al. On the Assignment Polytope , 1974 .
[18] Karl Nachtigall,et al. Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations , 2008, ATMOS.
[19] Edward Rothberg,et al. An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions , 2007, INFORMS J. Comput..
[20] Claude Le Pape,et al. Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..
[21] Ralf Borndörfer,et al. Integrated Optimization of Rolling Stock Rotations for Intercity Railways , 2016, Transp. Sci..
[22] Bruce L. Golden,et al. A library of local search heuristics for the vehicle routing problem , 2010, Math. Program. Comput..
[23] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[24] Timo Berthold. Heuristic algorithms in global MINLP solvers , 2014 .
[25] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[26] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[27] Paolo Toth,et al. Lower bounds and reduction procedures for the bin packing problem , 1990, Discret. Appl. Math..