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

Computational comparison on the partitioning strategies in multiple choice integer programming

Author

Listed:
  • Lin, Edward Y. H.
  • Bricker, Dennis L.

Abstract

No abstract is available for this item.

Suggested Citation

  • Lin, Edward Y. H. & Bricker, Dennis L., 1996. "Computational comparison on the partitioning strategies in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 88(1), pages 182-202, January.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:1:p:182-202
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00161-8
    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. Steven Zoraster, 1990. "The Solution of Large 0–1 Integer Programming Problems Encountered in Automated Cartography," Operations Research, INFORMS, vol. 38(5), pages 752-759, October.
    2. Arabinda Tripathy, 1984. "School Timetabling---A Case in Large Binary Integer Linear Programming," Management Science, INFORMS, vol. 30(12), pages 1473-1489, December.
    3. G. Terry Ross & Richard M. Soland, 1977. "Modeling Facility Location Problems as Generalized Assignment Problems," Management Science, INFORMS, vol. 24(3), pages 345-357, November.
    4. Lin, Edward Y. H. & Bricker, Dennis L., 1991. "On the calculation of true and pseudo penalties in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 55(2), pages 228-236, November.
    5. A. M. Geoffrion & R. E. Marsten, 1972. "Integer Programming Algorithms: A Framework and State-of-the-Art Survey," Management Science, INFORMS, vol. 18(9), pages 465-491, May.
    6. Dennis J. Sweeney & Richard A. Murphy, 1981. "Branch and Bound Methods for Multi-Item Scheduling," Operations Research, INFORMS, vol. 29(5), pages 853-864, October.
    7. Andris A. Zoltners & Prabhakant Sinha, 1980. "Integer Programming Models for Sales Resource Allocation," Management Science, INFORMS, vol. 26(3), pages 242-260, March.
    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. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    2. E L Hillsman, 1984. "The p-Median Structure as a Unified Linear Model for Location—Allocation Analysis," Environment and Planning A, , vol. 16(3), pages 305-318, March.
    3. Brian Lunday & Hanif Sherali & Kevin Lunday, 2012. "The coastal seaspace patrol sector design and allocation problem," Computational Management Science, Springer, vol. 9(4), pages 483-514, November.
    4. Drexl, Andreas & Haase, Knut, 1996. "Fast approximation methods for sales force deployment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 411, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. 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.
    6. George R. Wilson & Hemant K. Jain, 1988. "An approach to postoptimality and sensitivity analysis of zero‐one goal programs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(1), pages 73-84, February.
    7. Haase, Knut & Latteier, Jörg & Schirmer, Andreas, 1997. "The course scheduling problem at Lufthansa Technical Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 441, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    9. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    10. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    12. Edward Y H Lin & Chung-Min Wu, 2004. "The multiple-choice multi-period knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 187-197, February.
    13. S K Mirrazavi & S J Mardle & M Tamiz, 2003. "A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1155-1166, November.
    14. Fabio Caldieraro & Anne T. Coughlan, 2009. "Optimal Sales Force Diversification and Group Incentive Payments," Marketing Science, INFORMS, vol. 28(6), pages 1009-1026, 11-12.
    15. Zheng, Feifeng & Cheng, Yongxi & Xu, Yinfeng & Liu, Ming, 2013. "Competitive strategies for an online generalized assignment problem with a service consecution constraint," European Journal of Operational Research, Elsevier, vol. 229(1), pages 59-66.
    16. Kristiansen, Simon & Sørensen, Matias & Stidsen, Thomas R., 2011. "Elective course planning," European Journal of Operational Research, Elsevier, vol. 215(3), pages 713-720, December.
    17. 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.
    18. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    19. Derpich, Ivan & Vera, Jorge R., 2006. "Improving the efficiency of the Branch and Bound algorithm for integer programming based on "flatness" information," European Journal of Operational Research, Elsevier, vol. 174(1), pages 92-101, October.
    20. Boronico, Jess, 2000. "Quantitative modeling and technology driven departmental course scheduling," Omega, Elsevier, vol. 28(3), pages 327-346, June.

    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:88:y:1996:i:1:p:182-202. 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.