Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems
From MaRDI portal
Publication:6048198
DOI10.1080/0305215x.2021.1939695zbMath1523.90292arXiv1903.07041OpenAlexW3175896303MaRDI QIDQ6048198
Unnamed Author, C. Yalçın Kaya, Regina Sandra Burachik
Publication date: 10 October 2023
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07041
Related Items
Advancements in the computation of enclosures for multi-objective optimization problems ⋮ Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs
Cites Work
- Unnamed Item
- Unnamed Item
- Multiobjective linear and integer programming
- The \(L\)-shape search method for triobjective integer programming
- Multi-objective optimization models for patient allocation during a pandemic influenza outbreak
- A numerical method for nonconvex multi-objective optimal control problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Survey of multi-objective optimization methods for engineering
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- SCIP: solving constraint integer programs
- Generating the weakly efficient set of nonconvex multiobjective problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Trends in multicriteria decision making. Proceedings of the 13th international conference on Multiple criteria decison making. January 1997, Cape Town, South Africa
- A method for convex curve approximation
- Nonlinear multiobjective optimization
- Variational methods in partially ordered spaces
- A multi-objective decision model for investment in energy savings and emission reductions in coal mining
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A polyhedral branch-and-cut approach to global optimization
- Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy
- Scalarizing vector optimization problems
- Multicriteria engineering optimization problems: statement, solution and applications
- Finding a representative nondominated set for multi-objective mixed integer programs
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- New mixed integer-programming model for the pickup-and-delivery problem with transshipment
- Solution of a multi-objective and multi-index real-life transportation problem using different fuzzy membership functions
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Non-convex multi-objective optimization
- Response surface approximation of Pareto optimal front in multi-objective optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- International portfolio choice and political instability risk: a multi-objective approach
- Approximation methods in multiobjective programming
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- A Successive Approach to Compute the Bounded Pareto Front of Practical Multiobjective Optimization Problems
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Multi‐objective combinatorial optimization problems: A survey
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
