IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n340913.html

Fair Optimization and Networks: Models, Algorithms, and Applications

Author

Listed:
  • Wlodzimierz Ogryczak
  • Hanan Luss
  • Dritan Nace
  • Michał Pióro

Abstract

No abstract is available for this item.

Suggested Citation

  • Wlodzimierz Ogryczak & Hanan Luss & Dritan Nace & Michał Pióro, 2014. "Fair Optimization and Networks: Models, Algorithms, and Applications," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:340913
    DOI: 10.1155/2014/340913
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/340913
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/340913?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
    ---><---

    References listed on IDEAS

    as
    1. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    2. Atkinson, Anthony B., 1970. "On the measurement of inequality," Journal of Economic Theory, Elsevier, vol. 2(3), pages 244-263, September.
    3. Dritan Nace & James B. Orlin, 2007. "Lexicographically Minimum and Maximum Load Linear Programming Problems," Operations Research, INFORMS, vol. 55(1), pages 182-187, February.
    4. Ogryczak, Wlodzimierz, 1997. "On the lexicographic minimax approach to location problems," European Journal of Operational Research, Elsevier, vol. 100(3), pages 566-585, August.
    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. Wlodzimierz Ogryczak & Hanan Luss & Michał Pióro & Dritan Nace & Artur Tomaszewski, 2014. "Fair Optimization and Networks: A Survey," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    2. Letsios, Dimitrios & Mistry, Miten & Misener, Ruth, 2021. "Exact lexicographic scheduling and approximate rescheduling," European Journal of Operational Research, Elsevier, vol. 290(2), pages 469-478.
    3. Gabrielle Demange, 2021. "On the resolution of cross-liabilities," PSE Working Papers halshs-03151128, HAL.
    4. Ľuboš Buzna & Michal Koháni & Jaroslav Janáček, 2014. "An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    5. J. N. Hooker & H. P. Williams, 2012. "Combining Equity and Utilitarianism in a Mathematical Programming Model," Management Science, INFORMS, vol. 58(9), pages 1682-1693, September.
    6. Hrayer Aprahamian & Douglas R. Bish & Ebru K. Bish, 2019. "Optimal Risk-Based Group Testing," Management Science, INFORMS, vol. 65(9), pages 4365-4384, September.
    7. Hongming Li & Erick Delage & Ning Zhu & Michael Pinedo & Shoufeng Ma, 2024. "Distributional Robustness and Inequity Mitigation in Disaster Preparedness of Humanitarian Operations," Manufacturing & Service Operations Management, INFORMS, vol. 26(1), pages 197-214, January.
    8. Liu, Songsong & Papageorgiou, Lazaros G., 2018. "Fair profit distribution in multi-echelon supply chains via transfer prices," Omega, Elsevier, vol. 80(C), pages 77-94.
    9. Erkut, Erhan & Karagiannidis, Avraam & Perkoulidis, George & Tjandra, Stevanus A., 2008. "A multicriteria facility location model for municipal solid waste management in North Greece," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1402-1421, June.
    10. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    11. Zhang Jiangao & Shitao Yang, 2016. "On the Lexicographic Centre of Multiple Objective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 168(2), pages 600-614, February.
    12. Hanan Luss, 2010. "Equitable bandwidth allocation in content distribution networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(3), pages 266-278, April.
    13. Włodzimierz Ogryczak, 2009. "Inequality measures and equitable locations," Annals of Operations Research, Springer, vol. 167(1), pages 61-86, March.
    14. Kostreva, Michael M. & Ogryczak, Wlodzimierz & Wierzbicki, Adam, 2004. "Equitable aggregations and multiple criteria analysis," European Journal of Operational Research, Elsevier, vol. 158(2), pages 362-377, October.
    15. Mohammadmehdi Hakimifar & Vera C. Hemmelmayr & Fabien Tricoire, 2022. "A Bi-Objective Field-Visit Planning Problem for Rapid Needs Assessment under Travel-Time Uncertainty," Sustainability, MDPI, vol. 14(5), pages 1-16, March.
    16. Liu, Songsong & Papageorgiou, Lazaros G., 2013. "Multiobjective optimisation of production, distribution and capacity planning of global supply chains in the process industry," Omega, Elsevier, vol. 41(2), pages 369-382.
    17. Christ, Quentin & Dauzère-Pérès, Stéphane & Lepelletier, Guillaume, 2019. "An Iterated Min–Max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems," European Journal of Operational Research, Elsevier, vol. 279(2), pages 419-428.
    18. Mariusz Kaleta, 2014. "Price of Fairness on Networked Auctions," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    19. Mohammadmehdi Hakimifar & Vera C. Hemmelmayr & Fabien Tricoire, 2023. "A lexicographic maximin approach to the selective assessment routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 205-249, March.
    20. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.

    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:wly:jnljam:v:2014:y:2014:i:1:n:340913. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.