Pages that link to "Item:Q1361108"

The following pages link to Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108):

Displaying 24 items.

• Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
• An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
• Chebyshev center based column generation (Q765323) (← links)
• About Lagrangian methods in integer optimization (Q817183) (← links)
• Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem (Q849087) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems (Q1016355) (← links)
• Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
• Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
• Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
• Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
• Convexification of generalized network flow problem (Q1717233) (← links)
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
• A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
• Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints (Q1970426) (← links)
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
• Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
• A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations (Q2892150) (← links)
• An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)