Pages that link to "Item:Q3323706"

The following pages link to Some branch-and-bound procedures for fixed-cost transportation problems (Q3323706):

Displaying 32 items.

• Equivalent formulations for the branched transport and urban planning problems (Q304880) (← links)
• A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
• On lower bounds for the fixed charge problem (Q337190) (← links)
• An equivalent path functional formulation of branched transportation problems (Q632342) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648) (← links)
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← links)
• Facility location models for distribution planning (Q1069423) (← links)
• Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
• Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
• A branch and bound procedure for cost minimizing bulk transportation problem (Q1272567) (← links)
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
• Penalty computations for the set partitioning problem (Q1309877) (← links)
• A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
• A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973) (← links)
• A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
• Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• A branch-and-bound algorithm for solving fixed charge problems (Q3320127) (← links)
• Capacity improvement, penalties, and the fixed charge transportation problem (Q4261216) (← links)
• (Q4886440) (← links)
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem (Q5750718) (← links)