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

On weighting two criteria with a parameter in combinatorial optimization problems

Author

Listed:
  • Duin, C.W.
  • Volgenant, A.

Abstract

Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter.

Suggested Citation

  • Duin, C.W. & Volgenant, A., 2012. "On weighting two criteria with a parameter in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 1-6.
    • Handle: RePEc:eee:ejores:v:221:y:2012:i:1:p:1-6
    DOI: 10.1016/j.ejor.2012.01.054
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712000926
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.01.054?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. Punnen, Abraham P. & Nair, K. P. K., 1996. "An O(m log n) algorithm for the max + sum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 89(2), pages 423-426, March.
    2. Geetha, S. & Nair, K. P. K., 1993. "A variation of the assignment problem," European Journal of Operational Research, Elsevier, vol. 68(3), pages 422-426, August.
    3. R-H Huang & C-L Yang, 2009. "An algorithm for minimizing flow time and maximum earliness on a single machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(6), pages 873-877, June.
    4. Mauro Dell'Amico & Francesco Maffioli, 2000. "Combining Linear and Non-Linear Objectives in Spanning Tree Problems," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 253-269, June.
    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. Coutinho-Rodrigues, João & Tralhão, Lino & Alçada-Almeida, Luís, 2012. "A bi-objective modeling approach applied to an urban semi-desirable facility location problem," European Journal of Operational Research, Elsevier, vol. 223(1), pages 203-213.
    2. Brazil, M. & Ras, C.J. & Thomas, D.A., 2014. "A geometric characterisation of the quadratic min-power centre," European Journal of Operational Research, Elsevier, vol. 233(1), pages 34-42.

    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. Armstrong, Ronald D. & Jin, Zhiying, 1995. "On solving a variation of the assignment problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 142-147, November.
    2. Qingyun Tian & Yun Hui Lin & David Z. W. Wang, 2021. "Autonomous and conventional bus fleet optimization for fixed-route operations considering demand uncertainty," Transportation, Springer, vol. 48(5), pages 2735-2763, October.
    3. Xiucui Guan & Xinyan He & Panos M. Pardalos & Binwu Zhang, 2017. "Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector," Journal of Global Optimization, Springer, vol. 69(4), pages 911-925, December.
    4. Prabhjot Kaur & Kalpana Dahiya & Vanita Verma, 2021. "Time-cost trade-off analysis of a priority based assignment problem," OPSEARCH, Springer;Operational Research Society of India, vol. 58(2), pages 448-482, June.
    5. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    6. Abraham P. Punnen & Ruonan Zhang, 2011. "Quadratic bottleneck problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 153-164, March.
    7. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    8. Xiucui Guan & Panos Pardalos & Xia Zuo, 2015. "Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted $$l_\infty $$ l ∞ Norm," Journal of Global Optimization, Springer, vol. 61(1), pages 165-182, January.
    9. Cem Evrendilek & Ismail Hakki Toroslu & Seyedsasan Hashemikhabir, 2017. "Task assignment in tree-like hierarchical structures," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 631-655, August.
    10. Junhua Jia & Xiucui Guan & Qiao Zhang & Xinqiang Qian & Panos M. Pardalos, 2022. "Inverse max+sum spanning tree problem under weighted $$l_{\infty }$$ l ∞ norm by modifying max-weight vector," Journal of Global Optimization, Springer, vol. 84(3), pages 715-738, November.

    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:221:y:2012:i:1:p:1-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: 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.