IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v82y1995i1p176-189.html
   My bibliography  Save this article

Tabu search for the multilevel generalized assignment problem

Author

Listed:
  • Laguna, Manuel
  • Kelly, James P.
  • Gonzalez-Velarde, JoseLuis
  • Glover, Fred

Abstract

No abstract is available for this item.

Suggested Citation

  • Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    • Handle: RePEc:eee:ejores:v:82:y:1995:i:1:p:176-189
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0174-V
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fred Glover & John Hultz & Darwin Klingman, 1979. "Improved Computer-Based Planning Techniques. Part II," Interfaces, INFORMS, vol. 9(4), pages 12-20, August.
    2. Monique Guignard & Moshe B. Rosenwein, 1989. "Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 37(4), pages 658-663, August.
    3. Fred Glover & Darwin Klingman & Nancy Phillips, 1990. "Netform Modeling and Applications," Interfaces, INFORMS, vol. 20(4), pages 7-27, August.
    4. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    5. Barcia, Paulo & Jornsten, Kurt, 1990. "Improved Lagrangean decomposition: An application to the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 46(1), pages 84-92, May.
    6. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    2. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    3. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    4. Atan, Tankut S. & Pandit, Ram, 1996. "Auxiliary tool allocation in flexible manufacturing systems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 642-659, March.
    5. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    6. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 627, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
    8. Hill, Raymond R. & Reilly, Charles H., 2000. "Multivariate composite distributions for coefficients in synthetic optimization problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 64-77, February.
    9. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    10. Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
    11. June S. Park & Byung Ha Lim & Youngho Lee, 1998. "A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem," Management Science, INFORMS, vol. 44(12-Part-2), pages 271-282, December.
    12. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
    13. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    14. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
    16. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    17. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    18. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.
    19. Vidyarthi, Navneet & Jayaswal, Sachin & Chetty, Vikranth Babu Tirumala, 2013. "Exact Solution to Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2013-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    20. Behiri, Walid & Belmokhtar-Berraf, Sana & Chu, Chengbin, 2018. "Urban freight transport using passenger rail network: Scientific issues and quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 227-245.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:82:y:1995:i:1:p:176-189. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.