IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v232y2014i3p479-488.html
   My bibliography  Save this item

A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

Citations

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


Cited by:

  1. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
  2. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
  3. Nayeri, Sina & Sazvar, Zeinab & Heydari, Jafar, 2022. "A global-responsive supply chain considering sustainability and resiliency: Application in the medical devices industry," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
  4. 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.
  5. 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.
  6. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
  7. Kadziński, Miłosz & Tervonen, Tommi & Tomczyk, Michał K. & Dekker, Rommert, 2017. "Evaluation of multi-objective optimization approaches for solving green supply chain design problems," Omega, Elsevier, vol. 68(C), pages 168-184.
  8. Hartillo-Hermoso, María Isabel & Jiménez-Tafur, Haydee & Ucha-Enríquez, José María, 2020. "An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets," European Journal of Operational Research, Elsevier, vol. 282(2), pages 453-463.
  9. Bashir Bashir & Özlem Karsu, 2022. "Solution approaches for equitable multiobjective integer programming problems," Annals of Operations Research, Springer, vol. 311(2), pages 967-995, April.
  10. Alvaro Sierra Altamiranda & Hadi Charkhgard, 2019. "A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 823-840, October.
  11. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
  12. 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.
  13. Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
  14. Pham Thi Hoai & Hoai An Le Thi & Nguyen Canh Nam, 2021. "Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects," 4OR, Springer, vol. 19(1), pages 41-70, March.
  15. Ceyhan, Gökhan & Köksalan, Murat & Lokman, Banu, 2019. "Finding a representative nondominated set for multi-objective mixed integer programs," European Journal of Operational Research, Elsevier, vol. 272(1), pages 61-77.
  16. Tolga Bektaş, 2018. "Disjunctive Programming for Multiobjective Discrete Optimisation," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 625-633, November.
  17. 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.
  18. Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2015. "On the representation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 245(3), pages 767-778.
  19. De Santis, Marianna & Grani, Giorgio & Palagi, Laura, 2020. "Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming," European Journal of Operational Research, Elsevier, vol. 283(1), pages 57-69.
  20. Kaddani, Sami & Vanderpooten, Daniel & Vanpeperstraete, Jean-Michel & Aissi, Hassene, 2017. "Weighted sum model with partial preference information: Application to multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 665-679.
  21. Sunney Fotedar & Ann-Brith Strömberg & Torgny Almgren & Stefan Cedergren, 2023. "A criterion space decomposition approach to generalized tri-objective tactical resource allocation," Computational Management Science, Springer, vol. 20(1), pages 1-28, December.
  22. Stefan Ruzika & Carolin Torchiani, 2015. "Comments on: Static and dynamic source locations in undirected networks," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 655-659, October.
  23. Forget, Nicolas & Gadegaard, Sune Lauth & Nielsen, Lars Relund, 2022. "Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 302(3), pages 909-924.
  24. Mohammad S. Roni & Sandra D. Eksioglu & Kara G. Cafferty & Jacob J. Jacobson, 2017. "A multi-objective, hub-and-spoke model to design and manage biofuel supply chains," Annals of Operations Research, Springer, vol. 249(1), pages 351-380, February.
  25. Di Martinelly, Christine & Meskens, Nadine, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," International Journal of Production Economics, Elsevier, vol. 191(C), pages 323-334.
  26. 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.
  27. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
  28. Kerstin Dächert & Kathrin Klamroth, 2015. "A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems," Journal of Global Optimization, Springer, vol. 61(4), pages 643-676, April.
  29. Mansini, Renata & Zanella, Marina & Zanotti, Roberto, 2023. "Optimizing a complex multi-objective personnel scheduling problem jointly complying with requests from customers and staff," Omega, Elsevier, vol. 114(C).
  30. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
  31. Özgür Özpeynirci, 2017. "On nadir points of multiobjective integer programming problems," Journal of Global Optimization, Springer, vol. 69(3), pages 699-712, November.
  32. 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.
  33. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
  34. Che, Ada & Feng, Jianguang & Chen, Haoxun & Chu, Chengbin, 2015. "Robust optimization for the cyclic hoist scheduling problem," European Journal of Operational Research, Elsevier, vol. 240(3), pages 627-636.
  35. Dinçer Konur & Hadi Farhangi & Cihan H. Dagli, 2016. "A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 967-1006, October.
  36. Apichit Maneengam, 2023. "Multi-Objective Optimization of the Multimodal Routing Problem Using the Adaptive ε-Constraint Method and Modified TOPSIS with the D-CRITIC Method," Sustainability, MDPI, vol. 15(15), pages 1-22, August.
  37. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2019. "Preprocessing and cut generation techniques for multi-objective binary programming," European Journal of Operational Research, Elsevier, vol. 274(3), pages 858-875.
  38. William Pettersson & Melih Ozlen, 2020. "Multiobjective Integer Programming: Synergistic Parallel Approaches," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 461-472, April.
  39. Dächert, Kerstin & Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2017. "Efficient computation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 260(3), pages 841-855.
  40. Gokhan Kirlik & Serpil Sayın, 2015. "Computing the nadir point for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 62(1), pages 79-99, May.
  41. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
  42. Raimundo, Marcos M. & Ferreira, Paulo A.V. & Von Zuben, Fernando J., 2020. "An extension of the non-inferior set estimation algorithm for many objectives," European Journal of Operational Research, Elsevier, vol. 284(1), pages 53-66.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.