Pages that link to "Item:Q2030326"

The following pages link to Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid (Q2030326):

Displaying 3 items.

• Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm (Q2098052) (← links)
• Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
• Design of survivable wireless backhaul networks with reliability considerations (Q6164320) (← links)