Pages that link to "Item:Q3321854"

The following pages link to A combined approach to solve binary multicriteria problems (Q3321854):

Displaying 10 items.

• Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
• A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
• Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
• Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems (Q1075943) (← links)
• An algorithm for the bi-criterion integer programming problem (Q1075952) (← links)
• Drilling strategies for frontier areas (Q1091084) (← links)
• Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)