Pages that link to "Item:Q3796941"

The following pages link to NP-Hard, Capacitated, Balanced <i>p</i>-Median Problems on a Chain Graph with a Continuum of Link Demands (Q3796941):

Displaying 25 items.

• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
• 2-facility manifold location routing problem (Q526422) (← links)
• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation (Q645558) (← links)
• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations (Q1013385) (← links)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
• A hierarchical algorithm for the planar single-facility location routing problem (Q1761993) (← links)
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
• Integer linear programming models for grid-based light post location problem (Q1926907) (← links)
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods (Q2022209) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
• On the convergence of the Cooper's algorithm (Q2228419) (← links)
• The location-allocation problem of drone base stations (Q2273669) (← links)
• Multi-objective multi-layer congested facility location-allocation problem optimization with Pareto-based meta-heuristics (Q2290779) (← links)
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
• A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces (Q2355716) (← links)
• The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
• Capacitated, balanced, sequential location-allocation problems on chains and trees (Q2638927) (← links)
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms (Q5172481) (← links)
• Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots (Q6115626) (← links)