Pages that link to "Item:Q1761116"

The following pages link to Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116):

Displaying 8 items.

• Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
• Generalized multiple objective bottleneck problems (Q453049) (← links)
• Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
• On \(k\)-Max-optimization (Q1002079) (← links)
• The tricriterion shortest path problem with at least two bottleneck objective functions (Q1026760) (← links)
• Enhanced two-step method via relaxed order of \(\boldsymbol{\alpha}\)-satisfactory degrees for fuzzy multiobjective optimization (Q1719276) (← links)
• An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
• Speeding up Martins' algorithm for multiple objective shortest path problems (Q2441362) (← links)