Pages that link to "Item:Q1043327"

The following pages link to Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327):

Displaying 10 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• Multi-directional local search (Q339654) (← links)
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm (Q363591) (← links)
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
• Multi-objective optimization using statistical models (Q1728516) (← links)
• Multi-objective branch and bound (Q1753506) (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)