Pages that link to "Item:Q2496022"

The following pages link to On the capacitated concentrator location problem: a reformulation by discretization (Q2496022):

Displaying 21 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
• Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
• Modeling and solving a logging camp location problem (Q748565) (← links)
• Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
• Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
• Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
• Single PON network design with unconstrained splitting stages (Q2629639) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• (Q2861520) (← links)
• Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
• Models and heuristics for the <i>k</i> ‐degree constrained minimum spanning tree problem with node‐degree costs (Q4648687) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
• Locating Satellite Yards in Forestry Operations (Q6160212) (← links)