Lorenz dominance based algorithms to solve a practical multiobjective problem
From MaRDI portal
Recommendations
- Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems
- Logic optimality for multi-objective optimization
- scientific article; zbMATH DE number 4041617
- Decision making on Pareto front approximations with inherent nondominance
- Recent developments in screening methods for nondominated solutions in multiobjective optimization
Cites work
- scientific article; zbMATH DE number 1784661 (Why is no real title available?)
- scientific article; zbMATH DE number 1910919 (Why is no real title available?)
- scientific article; zbMATH DE number 2102231 (Why is no real title available?)
- A box decomposition algorithm to compute the hypervolume indicator
- A decision-theoretic approach to robust optimization in multivalued graphs
- Equitable aggregations and multiple criteria analysis
- Evolutionary Multi-Criterion Optimization
- Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems
- Inequality measures and equitable approaches to location problems
- Linear optimization with multiple equitable criteria
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Multi-objective optimization using evolutionary algorithms
- Multiple criteria linear programming model for portfolio selection
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Preference-inspired co-evolutionary algorithms using weight vectors
- Solving efficiently the 0-1 multi-objective knapsack problem
Cited in
(2)
This page was built for publication: Lorenz dominance based algorithms to solve a practical multiobjective problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725590)