Pages that link to "Item:Q3329185"

The following pages link to A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS (Q3329185):

Displaying 15 items.

• D.C. programming approach for multicommodity network optimization problems with step increasing cost functions (Q598597) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
• A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
• A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
• (Q3181418) (← links)
• Nonlinear cost network models in transportation analysis (Q3747201) (← links)
• Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms (Q3798488) (← links)
• A computationally efficient method for nonlinear multicommodity network flow problems (Q4347278) (← links)
• Inverse Nonlinear Multicommodity Flow Optimization by Column Generation (Q4653554) (← links)
• Optimal Two-commodity Flows with Non-linear Cost Functions (Q4864348) (← links)
• Monotonicity and conformality in multicommodity network‐flow problems (Q5241429) (← links)
• Cyclically monotone non-optimal <i>N</i>-marginal transport plans and Smirnov-type decompositions for <i>N</i>-flows (Q5854413) (← links)