Pages that link to "Item:Q4077726"

The following pages link to A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem (Q4077726):

Displaying 31 items.

• On lower bounds for the fixed charge problem (Q337190) (← links)
• Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Fixed charge problems with identical fixed charges (Q797500) (← links)
• In situ column generation for a cutting-stock problem (Q868997) (← links)
• A heuristic approach for the continuous error localization problem in data cleaning (Q868999) (← links)
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem (Q915648) (← links)
• Integer linear programming formulation of the material requirements planning problem (Q1142149) (← links)
• A search tree algorithm for plant location problems (Q1149880) (← links)
• A vertex ranking algorithm for the fixed-charge transportation problem (Q1151821) (← links)
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
• A family of heuristic solution methods for a class of nonlinear programming problems (Q1241183) (← 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)
• Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics (Q1823143) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems (Q1823858) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← 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)
• COAL: A new heuristic approach for solving the fixed charge problem - computational results (Q2277365) (← links)
• The noncooperative fixed charge transportation problem (Q2301973) (← links)
• Fractional polynomial bounds for the fixed charge problem (Q2342141) (← links)
• Tabu search applied to the general fixed charge problem (Q2367015) (← links)
• A heuristic algorithm for the fixed charge problem (Q2430567) (← 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)
• An aspect of bilevel fixed charge fractional transportation problem (Q2657531) (← links)
• Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem (Q2926472) (← links)
• A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)