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

Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

Author

Listed:
  • Amiri, Ali
  • Rolland, Erik
  • Barkhi, Reza

Abstract

No abstract is available for this item.

Suggested Citation

  • Amiri, Ali & Rolland, Erik & Barkhi, Reza, 1999. "Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures," European Journal of Operational Research, Elsevier, vol. 112(3), pages 635-645, February.
    • Handle: RePEc:eee:ejores:v:112:y:1999:i:3:p:635-645
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00401-3
    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. Kyungchul Park & Seokhoon Kang & Sungsoo Park, 1996. "An Integer Programming Approach to the Bandwidth Packing Problem," Management Science, INFORMS, vol. 42(9), pages 1277-1291, September.
    2. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    3. Bazaraa, Mokhtar S. & Goode, Jamie J., 1979. "A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality," European Journal of Operational Research, Elsevier, vol. 3(4), pages 322-338, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shaoning Han & Andrés Gómez & Oleg A. Prokopyev, 2022. "Fractional 0–1 programming and submodularity," Journal of Global Optimization, Springer, vol. 84(1), pages 77-93, September.
    2. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
    3. 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.
    4. Navneet Vidyarthi & Sachin Jayaswal & Vikranth Babu Tirumala Chetty, 2016. "Bandwidth packing problem with queueing delays: modelling and exact solution approach," Journal of Global Optimization, Springer, vol. 65(4), pages 745-776, August.
    5. Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev, 2017. "Fractional 0–1 programming: applications and algorithms," Journal of Global Optimization, Springer, vol. 69(1), pages 255-282, September.
    6. Bose, Indranil, 2009. "Bandwidth packing with priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 313-325, January.
    7. Amiri, Ali, 2005. "The selection and scheduling of telecommunication calls with time windows," European Journal of Operational Research, Elsevier, vol. 167(1), pages 243-256, November.
    8. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    9. Jayaswal, Sachin & Vidyarthi, Navneet & Das, Sagnik, 2014. "An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2014-12-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    10. Amiri, Ali & Barkhi, Reza, 2011. "The combinatorial bandwidth packing problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 37-45, January.

    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. Amiri, Ali, 2005. "The selection and scheduling of telecommunication calls with time windows," European Journal of Operational Research, Elsevier, vol. 167(1), pages 243-256, November.
    2. Bose, Indranil, 2009. "Bandwidth packing with priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 313-325, January.
    3. 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.
    4. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    5. Amiri, Ali & Barkhi, Reza, 2011. "The combinatorial bandwidth packing problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 37-45, January.
    6. Jinil Han & Kyungsik Lee & Chungmok Lee & Sungsoo Park, 2013. "Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 585-596, August.
    7. Jayaswal, Sachin & Vidyarthi, Navneet & Das, Sagnik, 2014. "An Efficient Solution Approach for Combinatorial Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2014-12-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    8. Navneet Vidyarthi & Sachin Jayaswal & Vikranth Babu Tirumala Chetty, 2016. "Bandwidth packing problem with queueing delays: modelling and exact solution approach," Journal of Global Optimization, Springer, vol. 65(4), pages 745-776, August.
    9. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2004. "ATM VP-based network design," European Journal of Operational Research, Elsevier, vol. 158(3), pages 555-569, November.
    10. François Lamothe & Emmanuel Rachelson & Alain Haït & Cedric Baudoin & Jean-Baptiste Dupé, 2021. "Randomized rounding algorithms for large scale unsplittable flow problems," Journal of Heuristics, Springer, vol. 27(6), pages 1081-1110, December.
    11. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    12. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    13. Kang, Jangha & Park, Kyungchul & Park, Sungsoo, 2009. "Optimal multicast route packing," European Journal of Operational Research, Elsevier, vol. 196(1), pages 351-359, July.
    14. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    15. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.
    16. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    17. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    18. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    19. Kaj Holmberg & Kurt Jörnsten, 1996. "Solving the generalized knapsack problem with variable coefficients," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(5), pages 673-689, August.
    20. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.

    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:112:y:1999:i:3:p:635-645. 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.