Pages that link to "Item:Q5449668"

The following pages link to Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668):

Displaying 8 items.

• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design (Q702717) (← links)
• A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
• Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks (Q2255986) (← links)
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
• Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design (Q3637378) (← links)
• Engineering Negative Cycle Canceling for Wind Farm Cabling (Q5075800) (← links)