IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i3d10.1007_s10878-005-4104-6.html
   My bibliography  Save this article

Efficient Solutions for Special Zero-One Programming Problems

Author

Listed:
  • Ariela Bilitzky

    (College of Management)

  • Arik Sadeh

    (Holon Academic Institute of Technology)

Abstract

A zero-one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge—management, data-mining, network flow, graph theory, reliability and statistical studies.

Suggested Citation

  • Ariela Bilitzky & Arik Sadeh, 2005. "Efficient Solutions for Special Zero-One Programming Problems," Journal of Combinatorial Optimization, Springer, vol. 10(3), pages 227-238, November.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:3:d:10.1007_s10878-005-4104-6
    DOI: 10.1007/s10878-005-4104-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-4104-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-4104-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. van Hoesel, Stan & Wagelmans, Albert & Kolen, Antoon, 1991. "A dual algorithm for the economic lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 52(3), pages 315-325, June.
    2. Brown, KL & Mesak, HI, 1992. "Scheduling professionals in the retail pharmacy chain," Omega, Elsevier, vol. 20(5-6), pages 671-678.
    3. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    4. Oguz, Osman, 1991. "Data dependent worst case bound improving techniques in zero--one programming," European Journal of Operational Research, Elsevier, vol. 51(3), pages 400-404, April.
    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. Arik Sadeh & Claudia Florina Radu & Cristina Feniser & Andrei Borşa, 2020. "Governmental Intervention and Its Impact on Growth, Economic Development, and Technology in OECD Countries," Sustainability, MDPI, vol. 13(1), pages 1-30, December.

    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. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    2. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    3. Oliver Czibula & Hanyu Gu & Aaron Russell & Yakov Zinder, 2017. "A multi-stage IP-based heuristic for class timetabling and trainer rostering," Annals of Operations Research, Springer, vol. 252(2), pages 305-333, May.
    4. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    5. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    6. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    7. G N Beligiannis & C Moschopoulos & S D Likothanassis, 2009. "A genetic algorithm approach to school timetabling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 23-42, January.
    8. Jaime Miranda, 2010. "eClasSkeduler: A Course Scheduling System for the Executive Education Unit at the Universidad de Chile," Interfaces, INFORMS, vol. 40(3), pages 196-207, June.
    9. Dimopoulou, M. & Miliotis, P., 2004. "An automated university course timetabling system developed in a distributed environment: A case study," European Journal of Operational Research, Elsevier, vol. 153(1), pages 136-147, February.
    10. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    11. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    12. Al-Yakoob, Salem M. & Sherali, Hanif D., 2007. "A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1028-1044, August.
    13. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    14. Niv Buchbinder & Tracy Kimbrel & Retsef Levi & Konstantin Makarychev & Maxim Sviridenko, 2013. "Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms," Operations Research, INFORMS, vol. 61(4), pages 1014-1029, August.
    15. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    16. De Boeck, Liesje & Beliën, Jeroen & Creemers, Stefan, 2016. "A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert," European Journal of Operational Research, Elsevier, vol. 253(1), pages 178-194.
    17. T. Godwin, 2022. "Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1055-1093, September.
    18. Olivier Pereira & Laurence Wolsey, 2001. "On the Wagner-Whitin Lot-Sizing Polyhedron," Mathematics of Operations Research, INFORMS, vol. 26(3), pages 591-600, August.
    19. K Papoutsis & C Valouxis & E Housos, 2003. "A column generation approach for the timetabling problem of Greek high schools," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(3), pages 230-238, March.
    20. P. Solano Cutillas & D. Pérez-Perales & M. M. E. Alemany Díaz, 2022. "A mathematical programming tool for an efficient decision-making on teaching assignment under non-regular time schedules," Operational Research, Springer, vol. 22(3), pages 2899-2942, July.

    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:spr:jcomop:v:10:y:2005:i:3:d:10.1007_s10878-005-4104-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.