Pages that link to "Item:Q3904373"

The following pages link to A New Optimization Method for Large Scale Fixed Charge Transportation Problems (Q3904373):

Displaying 31 items.

• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• Design and implementation of a decision support system for multistage investment in Chinese coal production and transportation (Q751492) (← 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)
• Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
• Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864) (← links)
• The teacher assignment problem: A special case of the fixed charge transportation problem (Q1278981) (← links)
• An algorithm for a concave production cost network flow problem (Q1301576) (← links)
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
• A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• A novel intensive distribution logistics network design and profit allocation problem considering sharing economy (Q1722693) (← links)
• Formulating and solving production planning problems (Q1806882) (← links)
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics (Q1823143) (← links)
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← 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)
• COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
• Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder (Q2378418) (← 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)
• Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals (Q2563669) (← links)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• An algorithm for solving fixed-charge problems using surrogate constraints (Q2638935) (← links)
• Minimizing a sum of staircase functions under linear constraints (Q3796985) (← links)
• (Q4261216) (← links)
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)
• An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
• An extreme‐point tabu‐search algorithm for fixed‐charge network problems (Q6087082) (← links)