Pages that link to "Item:Q1306346"

The following pages link to Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346):

Displaying 26 items.

• Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
• Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
• An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem (Q1041945) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• A survey on Benders decomposition applied to fixed-charge network design problems (Q1764759) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• Solving a capacitated hub location problem (Q2384615) (← links)
• Speed-up Benders decomposition using maximum density cut (MDC) generation (Q2442077) (← links)
• An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Accelerating Benders method using covering cut bundle generation (Q3563624) (← links)
• Portfolio Selection under Piecewise Affine Transaction Costs: An Integer Quadratic Formulation (Q3627693) (← links)
• (Q5020877) (← links)
• Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)
• An exact approach for the multicommodity network optimization problem with a step cost function (Q5244303) (← links)
• Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)