The following pages link to Borzou Rostami (Q323211):
Displayed 14 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A compact linearisation of Euclidean single allocation hub location problems (Q325380) (← links)
- Lower bounding procedures for the single allocation hub location problem (Q325391) (← links)
- Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation (Q342082) (← links)
- A generalized Gilmore-Lawler procedure for the quadratic assignment problem (Q510938) (← links)
- Reliable single allocation hub location problem under hub breakdowns (Q1652650) (← links)
- The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
- Stochastic single-allocation hub location (Q2029287) (← links)
- A revised reformulation-linearization technique for the quadratic assignment problem (Q2339837) (← links)
- A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels (Q2835680) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Single Allocation Hub Location with Heterogeneous Economies of Scale (Q5080641) (← links)
- A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs (Q6192831) (← links)
- Vehicle Utilization in Hub Network Design: Exploiting Economies of Scale in Transportation (Q6423064) (← links)