Benders decomposition, Lagrangean relaxation and metaheuristic design
暂无分享,去创建一个
[1] Salah E. Elmaghraby,et al. Activity networks: Project planning and control by network models , 1977 .
[2] V. Maniezzo,et al. An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .
[3] J. Barceló,et al. A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .
[4] Chung-Hsing Yeh,et al. Simulated annealing for multi-mode project scheduling , 2003 .
[5] Boris Polyak. Minimization of unsmooth functionals , 1969 .
[6] Maria Paola Scaparra,et al. Sloan School of Management Working Paper 4387-02 October 2002 A MULTI-EXCHANGE HEURISTIC FOR THE SINGLE SOURCE CAPACITATED FACILITY LOCATION PROBLEM , 2002 .
[7] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[8] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[9] Rainer Kolisch,et al. Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .
[10] Fabián A. Chudak,et al. Improved approximation algorithms for a capacitated facility location problem , 1999, SODA '99.
[11] RAINER KOLISCH,et al. Local search for nonpreemptive multi-mode resource-constrained project scheduling , 1997 .
[12] Arno Sprecher,et al. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm , 1998, Eur. J. Oper. Res..
[13] M. R. Rao,et al. An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .
[14] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[15] Andreas Drexl,et al. Nonpreemptive multi-mode resource-constrained project scheduling , 1993 .
[16] Stefan Voß,et al. Meta-heuristics: The State of the Art , 2000, Local Search for Planning and Scheduling.
[17] Tony J. Van Roy,et al. A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..
[18] Alexander Nareyek,et al. Local Search for Planning and Scheduling , 2001, Lecture Notes in Computer Science.
[19] R. Sridharan. A Lagrangian heuristic for the capacitated plant location problem with single source constraints , 1993 .
[20] M. Guignard. Lagrangean relaxation , 2003 .
[21] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[22] S Salhi,et al. Lagrangean heuristics applied to a variety of large capacitated plant location problems , 1998, J. Oper. Res. Soc..
[23] David P. Williamson,et al. Improved approximation algorithms for capacitated facility location problems , 1999, IPCO.
[24] Gündüz Ulusoy,et al. A constraint-based perspective in resource constrained project scheduling , 1994 .
[25] Di Yuan,et al. An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..
[26] Hanan Luss,et al. A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .
[27] Mikael Rönnqvist,et al. A repeated matching heuristic for the single-source capacitated facility location problem , 1999, Eur. J. Oper. Res..
[28] Hugues Delmaire,et al. REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .
[29] F. Brian Talbot,et al. Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case , 1982 .
[30] Márk Jelasity,et al. A Fully Distributed Lagrangean Metaheuristic for a P2P Overlay Network Design Problem , 2005 .
[31] Sönke Hartmann,et al. Project Scheduling with Multiple Modes: A Genetic Algorithm , 2001, Ann. Oper. Res..
[32] Francisco Barahona,et al. The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..
[33] Márk Jelasity,et al. An Ant Approach to Membership Overlay Design , 2004, ANTS Workshop.
[34] Anne-Marie Kermarrec,et al. Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.
[35] K. Bouleimen,et al. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..
[36] Hasan Pirkul,et al. Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..
[37] Vittorio Maniezzo,et al. A Heuristic Procedure For the Multi-mode Project Scheduling Problem Based on Benders’ Decomposition , 1999 .
[38] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[39] Jan Węglarz,et al. Project scheduling : recent models, algorithms, and applications , 1999 .
[40] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[41] Hanif D. Sherali,et al. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs , 1996, Oper. Res. Lett..
[42] Heng Li,et al. Multimode Project Scheduling Based on Particle Swarm Optimization , 2006, Comput. Aided Civ. Infrastructure Eng..