Pages that link to "Item:Q2445845"

The following pages link to The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845):

Displaying 5 items.

• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• The 0–1 inverse maximum independent set problem on forests and unicyclic graphs (Q3178148) (← links)