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

Cites Work

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

Cited In (4)

Uses Software

NETGEN

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106743)