Pages that link to "Item:Q3984287"

The following pages link to Approximate solutions of capacitated fixed-charge minimum cost network flow problems (Q3984287):

Displaying 23 items.

• A generalized bi-criteria fuzzy integer flow sharing problem (Q448933) (← links)
• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Mathematical models for selection of optimal place and size of connections considering the time-value of money (Q1044096) (← links)
• A dual ascent approach to the fixed-charge capacitated network design problem (Q1278408) (← 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)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
• A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
• Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure (Q2147939) (← links)
• A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
• Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) (← 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)
• A heuristic algorithm for a network problem with variable upper bounds (Q3199211) (← links)
• A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems (Q3352815) (← links)
• A relaxation/decomposition algorithm for the fixed charged network problem (Q3478275) (← links)
• (Q3802861) (← links)
• Analysis of a flow problem with fixed charges (Q3827774) (← links)
• Minimum cost flow in a network with an overestimated arc capacity (Q4973760) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)