New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach

DOI10.1016/j.ejor.2022.07.044OpenAlexW4288462067MaRDI QIDQ2106743

Yanyan Li

Publication date: 19 December 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.02630

zbMATH Keywords

integer linear programmingmultiple objective programminggeneration methodsrepresentation methods

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the representation of the search region in multi-objective optimization
• On finding representative non-dominated points for bi-objective integer network flow problems
• On the quality of discrete representations in multiple objective programming
• A review of interactive methods for multiobjective integer and mixed-integer programming
• A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
• Multiobjective optimization. Interactive and evolutionary approaches
• Improved \(\varepsilon\)-constraint method for multiobjective programming
• An exact method for computing the nadir values in multiple objective linear programming
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• An algorithm for the bi-criterion integer programming problem
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• An algorithm for the multiple objective integer linear programming problem
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Discrete representation of non-dominated sets in multi-objective linear programming
• Efficient computation of the search region in multi-objective optimization
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• 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
• Performance indicators in multiobjective optimization
• Representing the nondominated set in multi-objective mixed-integer programs
• Multi-objective integer programming: an improved recursive algorithm
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
• Computing the nadir point for multiobjective discrete optimization problems
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Diversity Maximization Approach for Multiobjective Optimization
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach