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

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives

Author

Listed:
  • Skriver, Anders J. V.
  • Andersen, Kim Allan
  • Holmberg, Kaj

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:156:y:2004:i:3:p:541-549
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00124-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. Deckro, R. F. & Winkofsky, E. P., 1983. "Solving zero-one multiple objective programs through implicit enumeration," European Journal of Operational Research, Elsevier, vol. 12(4), pages 362-374, April.
    2. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    3. Solanki, Rajendra S. & Appino, Perry A. & Cohon, Jared L., 1993. "Approximating the noninferior set in multiobjective linear programming problems," European Journal of Operational Research, Elsevier, vol. 68(3), pages 356-373, August.
    4. Gülseren Kiziltan & Erkut Yucaou{g}lu, 1983. "An Algorithm for Multiobjective Zero-One Linear Programming," Management Science, INFORMS, vol. 29(12), pages 1444-1453, December.
    5. Rasmussen, L. M., 1986. "Zero--one programming with multiple criteria," European Journal of Operational Research, Elsevier, vol. 26(1), pages 83-95, July.
    6. Alves, Maria Joao & Climaco, Joao, 2000. "An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound," European Journal of Operational Research, Elsevier, vol. 124(3), pages 478-494, August.
    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. Kalcsics, Jörg & Nickel, Stefan & Pozo, Miguel A. & Puerto, Justo & Rodríguez-Chía, Antonio M., 2014. "The multicriteria p-facility median location problem on networks," European Journal of Operational Research, Elsevier, vol. 235(3), pages 484-493.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Alves, Maria Joao & Climaco, Joao, 2004. "A note on a decision support system for multiobjective integer and mixed-integer programming problems," European Journal of Operational Research, Elsevier, vol. 155(1), pages 258-265, May.
    7. Isada, Yuriko & James, Ross J. W. & Nakagawa, Yuji, 2005. "An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint," European Journal of Operational Research, Elsevier, vol. 162(2), pages 503-513, April.
    8. 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.
    9. Demirtas, Ezgi Aktar & Üstün, Özden, 2008. "An integrated multiobjective decision making process for supplier selection and order allocation," Omega, Elsevier, vol. 36(1), pages 76-90, February.
    10. 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.
    11. Ted Ralphs & Matthew Saltzman & Margaret Wiecek, 2006. "An improved algorithm for solving biobjective integer programs," Annals of Operations Research, Springer, vol. 147(1), pages 43-70, October.
    12. Nikolaos Argyris & José Figueira & Alec Morton, 2011. "Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem," Journal of Global Optimization, Springer, vol. 49(2), pages 213-235, February.
    13. Banu Lokman & Murat Köksalan & Pekka J. Korhonen & Jyrki Wallenius, 2016. "An interactive algorithm to find the most preferred solution of multi-objective integer programs," Annals of Operations Research, Springer, vol. 245(1), pages 67-95, October.
    14. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    15. Barbati, Maria & Greco, Salvatore & Kadziński, Miłosz & Słowiński, Roman, 2018. "Optimization of multiple satisfaction levels in portfolio decision analysis," Omega, Elsevier, vol. 78(C), pages 192-204.
    16. Jieguang He & Xin Chen & Xindu Chen & Qiang Liu, 2016. "Distributed production planning based on ATC and MOILP considering different coordination patterns," Journal of Intelligent Manufacturing, Springer, vol. 27(5), pages 1067-1084, October.
    17. Li, Yihau & Rousseau, Jean-Marc & Gendreau, Michel, 1991. "Real-Time Scheduling on a Transit Bus Route: A 0-1 Stochastic Programming Model," Transportation Research Forum Proceedings 1990s 319064, Transportation Research Forum.
    18. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    19. Okitonyumbe Y.F., Joseph & Ulungu, Berthold E.-L., 2014. "Résolution des problèmes multi-objectif d’affectation et de sac-a-dos par la méthode du repère préférentiel de dominance [Solving multiobjectif assignment problem and multiobjectif knapsack problem," MPRA Paper 66125, University Library of Munich, Germany.
    20. Serpil Say{i}n & Panos Kouvelis, 2005. "The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm," Management Science, INFORMS, vol. 51(10), pages 1572-1581, 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:156:y:2004:i:3:p:541-549. 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.