Distribution based representative sets for multi-objective integer programs
DOI10.1016/J.EJOR.2020.01.001zbMATH Open1441.90149OpenAlexW2998770839WikidataQ126402159 ScholiaQ126402159MaRDI QIDQ2178085FDOQ2178085
Authors: Sami Serkan Özarık, Banu Lokman, Murat Köksalan 
Publication date: 7 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/distribution-based-representative-sets-for-multiobjective-integer-programs(e4133af9-d54b-4cfa-88d9-5950cc48c102).html
Recommendations
- Representing the nondominated set in multi-objective mixed-integer programs
- Finding a representative nondominated set for multi-objective mixed integer programs
- On the quality of discrete representations in multiple objective programming
- Representation of the non-dominated set in biobjective discrete optimization
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
Cites Work
- Title not available (Why is that?)
- Multi-objective integer programming: an improved recursive algorithm
- On Estimation of a Probability Density Function and Mode
- Title not available (Why is that?)
- Diversity Maximization Approach for Multiobjective Optimization
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Finding all nondominated points of multi-objective integer programs
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- On the quality of discrete representations in multiple objective programming
- A heuristic approach to bicriteria scheduling
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Efficient computation of the search region in multi-objective optimization
- Finding a representative nondominated set for multi-objective mixed integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Finding nadir points in multi-objective integer programs
Cited In (3)
Uses Software
This page was built for publication: Distribution based representative sets for multi-objective integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178085)
