Pages that link to "Item:Q2255968"
From MaRDI portal
The following pages link to A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968):
Displaying 14 items.
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making (Q5188993) (← links)
- A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
- Comments on: ``Static and dynamic source locations in undirected networks'' (Q5966288) (← links)
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
- A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
- A criterion space decomposition approach to generalized tri-objective tactical resource allocation (Q6067194) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
- Optimizing a linear function over the nondominated set of multiobjective integer programs (Q6091884) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
- A fast and robust algorithm for solving biobjective mixed integer programs (Q6616277) (← links)
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems (Q6616278) (← links)
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming (Q6616283) (← links)
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors (Q6667690) (← links)
