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

Zero--one programming with multiple criteria

Author

Listed:
  • Rasmussen, L. M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Rasmussen, L. M., 1986. "Zero--one programming with multiple criteria," European Journal of Operational Research, Elsevier, vol. 26(1), pages 83-95, July.
    • Handle: RePEc:eee:ejores:v:26:y:1986:i:1:p:83-95
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(86)90161-X
    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.

    Citations

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


    Cited by:

    1. Karaivanova, Jasmina & Korhonen, Pekka & Narula, Subhash & Wallenius, Jyrki & Vassilev, Vassil, 1995. "A reference direction approach to multiple objective integer linear programming," European Journal of Operational Research, Elsevier, vol. 81(1), pages 176-187, February.
    2. Gutierrez, J. & Puerto, J. & Sicilia, J., 2004. "The multiscenario lot size problem with concave costs," European Journal of Operational Research, Elsevier, vol. 156(1), pages 162-182, July.
    3. Fernandez, Elena & Puerto, Justo, 2003. "Multiobjective solution of the uncapacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 509-529, March.
    4. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    5. Skriver, Anders J. V. & Andersen, Kim Allan & Holmberg, Kaj, 2004. "Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives," European Journal of Operational Research, Elsevier, vol. 156(3), pages 541-549, August.
    6. Zhang, Cai Wen & Ong, Hoon Liong, 2004. "Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic," European Journal of Operational Research, Elsevier, vol. 159(3), pages 545-557, December.
    7. Gabriel, Steven A. & Kumar, Satheesh & Ordonez, Javier & Nasserian, Amirali, 2006. "A multiobjective optimization model for project selection with probabilistic considerations," Socio-Economic Planning Sciences, Elsevier, vol. 40(4), pages 297-313, December.
    8. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    9. Alves, Maria Joao & Climaco, Joao, 2007. "A review of interactive methods for multiobjective integer and mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 99-115, July.
    10. S. Razavyan, 2016. "A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-23, August.
    11. Rooderkerk, Robert P. & van Heerde, Harald J., 2016. "Robust optimization of the 0–1 knapsack problem: Balancing risk and return in assortment optimization," European Journal of Operational Research, Elsevier, vol. 250(3), pages 842-854.
    12. Farahani, Reza Zanjirani & Asgari, Nasrin, 2007. "Combination of MCDM and covering techniques in a hierarchical model for facility location: A case study," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1839-1858, February.
    13. Mavrotas, G. & Diakoulaki, D., 1998. "A branch and bound algorithm for mixed zero-one multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 530-541, June.
    14. Sylva, John & Crema, Alejandro, 2004. "A method for finding the set of non-dominated vectors for multiple objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 158(1), pages 46-55, October.

    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:26:y:1986:i:1:p:83-95. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.