Pages that link to "Item:Q1809831"

The following pages link to Exact solution methods for uncapacitated location problems with convex transportation costs (Q1809831):

Displaying 11 items.

• Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional (Q998681) (← links)
• A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
• The importance of freight villages: an implementation in TCDD (Q2285269) (← links)
• A novel differential evolution algorithm for binary optimization (Q2376130) (← links)
• Solving a capacitated hub location problem (Q2384615) (← links)
• A bi-level programming model and solution algorithm for the location of logistics distribution centers (Q2470316) (← links)
• A new approach based on the surrogating method in the project time compression problems (Q2507391) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses (Q3502137) (← links)
• Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning (Q5111126) (← links)
• A capacitated facility location problem with constrained backlogging probabilities (Q5428725) (← links)