Pages that link to "Item:Q526844"

The following pages link to A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844):

Displaying 15 items.

• On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
• A fast algorithm for the rectilinear distance location problem (Q1616792) (← links)
• On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon (Q1688448) (← links)
• Optimized assignment patterns in mobile edge cloud networks (Q1734851) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (Q2029899) (← links)
• Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
• Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670) (← links)
• An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
• Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358) (← links)
• An integrated planning model in centralized power systems (Q2189954) (← links)
• An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
• An accelerated L-shaped method for solving two-stage stochastic programs in disaster management (Q2288985) (← links)
• The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
• Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146) (← links)