Pages that link to "Item:Q5650540"

The following pages link to An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem (Q5650540):

Displaying 7 items.

• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
• Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
• Global search algorithms for minimum concave-cost network flow problems (Q1200522) (← links)
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)