Pages that link to "Item:Q1956483"

The following pages link to Selection of warehouse sites for clustering ration shops to them with two objectives through a heuristic algorithm incorporating tabu search (Q1956483):

Displaying 3 items.

• A bicriterion call center problem through an evolved branch and bound algorithm (Q505103) (← links)
• Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized (Q522430) (← links)
• A cost-time trade-off Königsberg bridge problem traversing all the seven bridges allowing repetition (Q1788588) (← links)