Pages that link to "Item:Q2571939"
From MaRDI portal
The following pages link to A method for generating all efficient solutions of 0-1 multi-objective linear programming problem (Q2571939):
Displaying 5 items.
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← 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)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
