Pages that link to "Item:Q3621927"
From MaRDI portal
The following pages link to Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems (Q3621927):
Displaying 19 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains (Q513645) (← links)
- Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
- An evolutionary approach to generalized biobjective traveling salesperson problem (Q1652174) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Representing the nondominated set in multi-objective mixed-integer programs (Q2242330) (← links)
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem (Q2337383) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Estimating the number of basins of attraction of multi-objective combinatorial problems (Q2424731) (← links)
- A simple method for approximating a general Pareto surface (Q3005831) (← links)
- Multiobjective combinatorial optimization: some approaches (Q3074964) (← links)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q3541795) (← links)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One (Q5301134) (← links)
- Approximating nondominated sets in continuous multiobjective optimization problems (Q5318290) (← links)
- Biobjective UAV routing for a mission to visit multiple mobile targets (Q6073279) (← links)
