Decomposition techniques with mixed integer programming and heuristics for home healthcare planning
暂无分享,去创建一个
[1] G. Reklaitis,et al. Decomposition Approaches to Batch Plant Design and Planning , 1996 .
[2] Dario Landa Silva,et al. A Development and Integration Framework for Optimisation-based Enterprise Solutions , 2014, ICORES.
[3] M. Rönnqvist,et al. A Branch and Price Algorithm for the Combined Vehicle Routing and Scheduling Problem With Synchronization Constraints , 2007 .
[4] Dario Landa-Silva,et al. A study of genetic operators for the Workforce Scheduling and Routing Problem , 2015 .
[5] Martin W. P. Savelsbergh,et al. A Decomposition Approach for the Inventory-Routing Problem , 2004, Transp. Sci..
[6] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[7] Pisal Yenradee,et al. PSO-based algorithm for home care worker scheduling in the UK , 2007, Comput. Ind. Eng..
[8] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..
[9] Hernán G. Abeledo,et al. A branch-and-price approach for large-scale employee tour scheduling problems , 2007, Ann. Oper. Res..
[10] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[11] Esben Kolind,et al. The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach , 2009, Comput. Oper. Res..
[12] Andrzej Ruszczyski. An augmented Lagrangian decomposition method for block diagonal linear programming problems , 1989 .
[13] Hae-Sang Park,et al. A simple and fast algorithm for K-medoids clustering , 2009, Expert Syst. Appl..
[14] Richard F. Hartl,et al. D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..
[15] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.
[16] Chinyao Low,et al. Heuristic solutions to multi-depot location-routing problems , 2002, Comput. Oper. Res..
[17] Spss,et al. Discovering Statistics (4th Edition ed. , 2013 .
[18] Marshall L. Fisher,et al. The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..
[19] André Langevin,et al. Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..
[20] Laurence A. Wolsey,et al. Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.
[21] Dario Landa Silva,et al. Workforce scheduling and routing problems: literature survey and computational study , 2014, Annals of Operations Research.
[22] Jean-François Cordeau,et al. Using Benders Decomposition to Implicitly Model Tour Scheduling , 2002, Ann. Oper. Res..
[23] Christelle Guéret,et al. On the dynamic technician routing and scheduling problem , 2012 .
[24] A. Matta,et al. A Home Care Scheduling Model For Human Resources , 2006, 2006 International Conference on Service Systems and Service Management.
[25] I. Grossmann,et al. A decomposition approach for the scheduling of a steel plant production , 2001 .
[26] Alysson M. Costa. A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..
[27] Dario Landa Silva,et al. Mixed Integer Programming with Decomposition to Solve a Workforce Scheduling and Routing Problem , 2015, ICORES.
[28] Jesper Larsen,et al. The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies , 2012, Eur. J. Oper. Res..
[29] Mark S. Daskin,et al. A warehouse location-routing problem , 1985 .
[30] Ted K. Ralphs,et al. Decomposition Methods for Integer Programming , 2011 .
[31] Andy P. Field,et al. Discovering Statistics Using Ibm Spss Statistics , 2017 .
[32] Mikael Rönnqvist,et al. Combined vehicle routing and scheduling with temporal precedence and synchronization constraints , 2008, Eur. J. Oper. Res..
[33] Matthew H. Bassett,et al. Decomposition techniques for the solution of large-scale scheduling problems , 1996 .
[34] Graham Kendall,et al. Hybrid Heuristic for Multi-carrier Transportation Plans , 2011 .
[35] Juan-José Salazar-González,et al. Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier , 2014 .
[36] Dario Landa Silva,et al. A Variable Neighbourhood Search for the Workforce Scheduling and Routing Problem , 2015, NaBIC.
[37] François Vanderbeck,et al. On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..
[38] Jean-François Cordeau,et al. Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..