Pages that link to "Item:Q1265864"

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

Displaying 10 items.

• Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
• A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem (Q1014998) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← 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)
• 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)
• Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
• Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)