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

The TV-Break Packing Problem

Author

Listed:
  • Benoist, Thierry
  • Bourreau, Eric
  • Rottembourg, Benoit

Abstract

No abstract is available for this item.

Suggested Citation

  • Benoist, Thierry & Bourreau, Eric & Rottembourg, Benoit, 2007. "The TV-Break Packing Problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1371-1386, February.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1371-1386
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00830-1
    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. Sourd, Francis & Chretienne, Philippe, 1999. "Fiber-to-object assignment heuristics," European Journal of Operational Research, Elsevier, vol. 117(1), pages 1-14, August.
    2. Torsten Fahle & Meinolf Sellmann, 2002. "Cost Based Filtering for the Constrained Knapsack Problem," Annals of Operations Research, Springer, vol. 115(1), pages 73-93, September.
    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. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.

    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. Stefano Gualandi & Federico Malucelli, 2012. "Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 81-100, February.
    2. Roberto Rossi & S. Tarim & Brahim Hnich & Steven Prestwich, 2012. "Constraint programming for stochastic inventory systems under shortage cost," Annals of Operations Research, Springer, vol. 195(1), pages 49-71, May.
    3. Stefano Gualandi & Federico Malucelli, 2013. "Constraint Programming-based Column Generation," Annals of Operations Research, Springer, vol. 204(1), pages 11-32, April.
    4. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, 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:176:y:2007:i:3:p:1371-1386. 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.