Pages that link to "Item:Q336534"

The following pages link to Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534):

Displayed 7 items.

• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) ‎ (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) ‎ (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) ‎ (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) ‎ (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) ‎ (← links)
• Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) ‎ (← links)
• On single-source capacitated facility location with cost and fairness objectives (Q2029269) ‎ (← links)