Pages that link to "Item:Q5750718"

The following pages link to A Branch-and-Bound Method for the Fixed Charge Transportation Problem (Q5750718):

Displaying 29 items.

• On lower bounds for the fixed charge problem (Q337190) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← 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)
• A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge (Q1002061) (← 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)
• Discontinuous piecewise linear optimization (Q1380942) (← links)
• A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
• On the transformation mechanism for formulating a multiproduct two-layer supply chain network design problem as a network flow model (Q1718489) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem (Q1761123) (← links)
• Solving fixed charge transportation problem with interval parameters (Q1791478) (← links)
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Stochastic optimization models for a single-sink transportation problem (Q2271804) (← links)
• Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
• A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← 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)
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
• Some Transportation Problems Under Uncertain Environments (Q2947194) (← links)
• (Q4261216) (← links)
• Multiperiod tool and production assignment in flexible manufacturing systems (Q4394267) (← links)
• An algorithm for finding the optimum solution of solid fixed-charge transportation problem (Q4764850) (← links)
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)