IDEAS home Printed from https://ideas.repec.org/r/spr/annopr/v147y2006i1p343-36010.1007-s10479-006-0074-z.html
   My bibliography  Save this item

A discussion of scalarization techniques for multiple objective integer programming

Citations

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


Cited by:

  1. Ulf Speer & Kathrin Fischer, 2017. "Scheduling of Different Automated Yard Crane Systems at Container Terminals," Transportation Science, INFORMS, vol. 51(1), pages 305-324, February.
  2. Zhang, Weihua & Reimann, Marc, 2014. "A simple augmented ∊-constraint method for multi-objective mathematical integer programming problems," European Journal of Operational Research, Elsevier, vol. 234(1), pages 15-24.
  3. Schmidt, M. & Schöbel, Anita & Thom, Lisa, 2019. "Min-ordering and max-ordering scalarization methods for multi-objective robust optimization," European Journal of Operational Research, Elsevier, vol. 275(2), pages 446-459.
  4. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
  5. Li, Ruonan & Mhaskar, Prashant & Mahalec, Vladimir, 2021. "Integration of energy systems for buildings and light industrial plants," Energy, Elsevier, vol. 233(C).
  6. Ayfer Basar & Özgür Kabak & Y. Ilker Topcu, 2017. "A Decision Support Methodology for Locating Bank Branches: A Case Study in Turkey," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 16(01), pages 59-86, January.
  7. Mohammad Fattahi, 2020. "A data-driven approach for supply chain network design under uncertainty with consideration of social concerns," Annals of Operations Research, Springer, vol. 288(1), pages 265-284, May.
  8. Özlen, Melih & Azizoglu, Meral, 2009. "Multi-objective integer programming: A general approach for generating all non-dominated solutions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 25-35, November.
  9. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
  10. Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.
  11. Melih Ozlen & Meral Azizoğlu & Benjamin Burton, 2013. "Optimising a nonlinear utility function in multi-objective integer programming," Journal of Global Optimization, Springer, vol. 56(1), pages 93-102, May.
  12. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
  13. Hombach, Laura Elisabeth & Walther, Grit, 2015. "Pareto-efficient legal regulation of the (bio)fuel market using a bi-objective optimization model," European Journal of Operational Research, Elsevier, vol. 245(1), pages 286-295.
  14. Carolina Almeida & Richard Gonçalves & Elizabeth Goldbarg & Marco Goldbarg & Myriam Delgado, 2012. "An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem," Annals of Operations Research, Springer, vol. 199(1), pages 305-341, October.
  15. Po-Lung Yu & Yen-Chu Chen, 2012. "Dynamic multiple criteria decision making in changeable spaces: from habitual domains to innovation dynamics," Annals of Operations Research, Springer, vol. 197(1), pages 201-220, August.
  16. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
  17. Jesús Sáez-Aguado & Paula Camelia Trandafir, 2018. "Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(2), pages 251-283, April.
  18. Hadi Charkhgard & Martin Savelsbergh & Masoud Talebian, 2018. "Nondominated Nash points: application of biobjective mixed integer programming," 4OR, Springer, vol. 16(2), pages 151-171, June.
  19. Oylum S¸eker & Mucahit Cevik & Merve Bodur & Young Lee & Mark Ruschin, 2023. "A Multiobjective Approach for Sector Duration Optimization in Stereotactic Radiosurgery Treatment Planning," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 248-264, January.
  20. Hombach, Laura Elisabeth & Büsing, Christina & Walther, Grit, 2018. "Robust and sustainable supply chains under market uncertainties and different risk attitudes – A case study of the German biodiesel market," European Journal of Operational Research, Elsevier, vol. 269(1), pages 302-312.
  21. Jie Wu & Liang Liang, 2012. "A multiple criteria ranking method based on game cross-evaluation approach," Annals of Operations Research, Springer, vol. 197(1), pages 191-200, August.
  22. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
  23. Masar Al-Rabeeah & Santosh Kumar & Ali Al-Hasani & Elias Munapo & Andrew Eberhard, 2019. "Bi-objective integer programming analysis based on the characteristic equation," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 937-944, October.
  24. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.
  25. Justo Puerto & Moises Rodr'iguez-Madrena & Andrea Scozzari, 2019. "Location and portfolio selection problems: A unified framework," Papers 1907.07101, arXiv.org.
  26. Botte, Marco & Schöbel, Anita, 2019. "Dominance for multi-objective robust optimization concepts," European Journal of Operational Research, Elsevier, vol. 273(2), pages 430-440.
  27. Shahparvari, Shahrooz & Chhetri, Prem & Abbasi, Babak & Abareshi, Ahmad, 2016. "Enhancing emergency evacuation response of late evacuees: Revisiting the case of Australian Black Saturday bushfire," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 148-176.
  28. Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
  29. Bixuan Sun & Jeffrey Apland, 2019. "Operational planning of public transit with economic and environmental goals: application to the Minneapolis–St. Paul bus system," Public Transport, Springer, vol. 11(2), pages 237-267, August.
  30. Florios, Kostas & Mavrotas, George & Diakoulaki, Danae, 2010. "Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 203(1), pages 14-21, May.
  31. Cacchiani, Valentina & D’Ambrosio, Claudia, 2017. "A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 920-933.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.