Pages that link to "Item:Q613484"
From MaRDI portal
The following pages link to Approximating the Pareto optimal set using a reduced set of objective functions (Q613484):
Displaying 15 items.
- Higher and lower-level knowledge discovery from Pareto-optimal sets (Q377755) (← links)
- Criteria and dimension reduction of linear multiple criteria optimization problems (Q427372) (← links)
- Dynamic algorithm selection for Pareto optimal set approximation (Q506461) (← links)
- Pareto set reduction based on an arbitrary finite collection of numerical information on the preference relation (Q656363) (← links)
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482) (← links)
- Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives (Q945048) (← links)
- Boosting efficiency for computing the Pareto frontier on tree structured networks (Q1626740) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- Minimizing the area of a Pareto confidence region (Q1926837) (← links)
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion (Q2189877) (← links)
- Finding preferred subsets of Pareto optimal solutions (Q2427390) (← links)
- Approximation of a set of Pareto-optimal solutions (Q3755244) (← links)
- On Degree of Pareto Set Reduction Using Information Quanta (Q5054514) (← links)
- Aggregate objective functions and Pareto frontiers: required relationships and practical implications (Q5958050) (← links)
- Bargaining on monotonic social choice environments (Q6123435) (← links)
