Pages that link to "Item:Q5534684"

The following pages link to An approximate solution method for the fixed charge problem (Q5534684):

Displaying 24 items.

• On lower bounds for the fixed charge problem (Q337190) (← links)
• Fixed charge problems with identical fixed charges (Q797500) (← links)
• A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821) (← links)
• Heuristic procedures for the m-partial cover problem on a plane (Q1169687) (← links)
• Quasi-concave minimization subject to linear constraints (Q1215459) (← links)
• The fixed charge problem. I: A new heuristic method (Q1228545) (← 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)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics (Q1823143) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← 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)
• 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)
• 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)
• COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
• Degeneracy in fixed cost transportation problems (Q4060725) (← links)
• An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem (Q4764857) (← links)
• A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)
• An approximative algorithm for the fixed charge problem (Q5580061) (← links)
• La programacion lineal bivalente mixta: Nuevo campo de aplicabilidad de las tecnicas de programacion lineal (Q5681832) (← links)