Pages that link to "Item:Q2655611"

The following pages link to Discretized formulations for capacitated location problems with modular distribution costs (Q2655611):

Displaying 12 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• A knapsack problem as a tool to solve the production planning problem in small foundries (Q1761949) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
• Facets for the single node fixed-charge network set with a node set-up variable (Q2448216) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
• Determining the best shipper sizes for sending products to customers (Q2803267) (← links)
• (Q2861520) (← links)
• Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
• Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)