Pages that link to "Item:Q1265864"

The following pages link to Solving to optimality the uncapacitated fixed-charge network flow problem (Q1265864):

Displaying 22 items.

• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Uncapacitated flow-based extended formulations (Q745688) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
• Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach (Q1854755) (← links)
• Flow constrained minimum cost flow problem (Q1937859) (← links)
• Computational risk management techniques for fixed charge network flow problems with uncertain arc failures (Q1945698) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound (Q2770085) (← links)
• Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem (Q2899064) (← links)
• A relaxation/decomposition algorithm for the fixed charged network problem (Q3478275) (← links)
• (Q4355486) (← links)
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem (Q4808430) (← links)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)