Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints

DOI10.1016/S0167-6377(99)00059-0zbMath1109.90335MaRDI QIDQ1970426

Siriphong Lawphongpanich

Publication date: 21 March 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

decomposition techniquetraffic assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Dantzig-Wolfe reformulations for binary quadratic problems

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Decomposition Principle for Linear Programs
• Restricted simplicial decomposition: Computation and extensions
• An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
• Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
• Nested decomposition for dynamic models
• On Rutenberg's Decomposition Method
• Nested Decomposition and Multi-Stage Linear Programs
• Simplicial decomposition in nonlinear programming algorithms
• An extension of the frank and Wolfe method of feasible directions
• Restricted simplicial decomposition with side constraints
• Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method

This page was built for publication: Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints