Pages that link to "Item:Q3730370"

The following pages link to Tailoring Benders decomposition for uncapacitated network design (Q3730370):

Displaying 50 items.

• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• Benders decomposition for set covering problems. Almost satisfying the consecutive ones property (Q512865) (← links)
• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• Tree network design avoiding congestion (Q646180) (← links)
• Scatter search for network design problem (Q817138) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Multiple allocation hub-and-spoke network design under hub congestion (Q833525) (← links)
• A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
• The generalized fixed-charge network design problem (Q856677) (← links)
• Benders decomposition for the uncapacitated multiple allocation hub location problem (Q941531) (← links)
• An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure (Q1184354) (← links)
• Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
• A robustness approach to uncapacitated network design problems (Q1278322) (← links)
• Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
• A comparison of optimal methods for local access uncapacitated network design (Q1599315) (← links)
• From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem (Q1754726) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure (Q2029964) (← links)
• Refined cut selection for Benders decomposition: applied to network capacity expansion problems (Q2074837) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network (Q2196095) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion (Q2292358) (← links)
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints (Q2294760) (← links)
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
• Solving a capacitated hub location problem (Q2384615) (← links)
• Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
• A Benders decomposition approach for the robust spanning tree problem with interval data (Q2503220) (← links)
• Memetic algorithms (Q2573010) (← links)
• Benders decomposition for network design covering problems (Q2669611) (← links)
• Benders decomposition for local access network design with two technologies (Q2752468) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Accelerating Benders decomposition by local branching (Q2901070) (← links)
• A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
• A nested benders decomposition approach for telecommunication network planning (Q3588806) (← links)
• LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
• Analysis of a flow problem with fixed charges (Q3827774) (← links)
• Optimization of Internet Protocol network design and routing (Q4446916) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)