Capacity and flow assignment of data networks by generalized Benders decomposition
From MaRDI portal
Publication:5954665
DOI10.1023/A:1011280023547zbMath1002.90082MaRDI QIDQ5954665
Philippe Mahey, Abdelhamid Benchakroun, Florence Boyer
Publication date: 21 January 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
network design; communication network; generalized Benders decomposition; mixed-integer nonlinear model; multicommodity flow networks
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
90B80: Discrete location and assignment
Related Items
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, A conic quadratic formulation for a class of convex congestion functions in network flow problems, A survey on Benders decomposition applied to fixed-charge network design problems, A tabu search algorithm for the routing and capacity assignment problem in computer networks, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Separable convexification and DCA techniques for capacity and flow assignment problems