Pages that link to "Item:Q1804068"

The following pages link to A branch-and-bound method for multicommodity location with balancing requirements (Q1804068):

Displaying 11 items.

• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
• A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
• A branch-and-bound method for multicommodity location with balancing requirements (Q1804068) (← links)
• Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996) (← links)
• Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
• A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
• Bicriteria optimization model for locating maritime container depots: application to the Port of Valencia (Q2357881) (← links)
• A tabu search procedure for multicommodity location/allocation with balancing requirements (Q2367013) (← links)
• Dynamic supply chain design with inventory (Q2384884) (← links)