Pages that link to "Item:Q3292913"

The following pages link to Fixed-cost transportation problems (Q3292913):

Displaying 40 items.

• On lower bounds for the fixed charge problem (Q337190) (← links)
• Two classical transportation problems revisited: pure constant fixed charges and the paradox (Q409900) (← links)
• Fixed charge transportation problem with type-2 fuzzy variables (Q497903) (← links)
• IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
• Approximating some network design problems with node costs (Q638508) (← links)
• A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations (Q657059) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• An extension of the product-parts replacement problem (Q698037) (← links)
• Uncertain random shortest path problem (Q781302) (← links)
• Logical processing for integer programming (Q817209) (← links)
• Heuristic algorithms for the fixed-charge transportation problem (Q998695) (← links)
• A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821) (← links)
• Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
• A study of the fixed charge transportation problem (Q1245150) (← links)
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
• A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← 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 matheuristic for the two-stage fixed-charge transportation problem (Q1652635) (← links)
• Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic (Q1687668) (← links)
• New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation (Q1735183) (← links)
• A genetic algorithm for solving the fixed-charge transportation model: two-stage problem (Q1761123) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Credit linked two-stage multi-objective transportation problem in rough and bi-rough environments (Q2156925) (← links)
• A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes (Q2185523) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Exact algorithm for solving a special fixed-charge linear programming problem (Q2277362) (← links)
• Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
• A heuristic algorithm for the fixed charge problem (Q2430567) (← 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)
• Some Transportation Problems Under Uncertain Environments (Q2947194) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
• An approximative algorithm for the fixed charge problem (Q5580061) (← links)
• Minimizing settlements (Q6100485) (← links)
• The transportation problem with packing constraints (Q6106585) (← links)
• Scalable timing-aware network design via Lagrangian decomposition (Q6112744) (← links)