Capacity and flow assignment of data networks by generalized Benders decomposition

DOI10.1023/A:1011280023547zbMath1002.90082MaRDI QIDQ5954665

Abdelhamid Benchakroun, Philippe Mahey, Florence Boyer

Publication date: 21 January 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

network designcommunication networkgeneralized Benders decompositionmixed-integer nonlinear modelmulticommodity flow networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (10)

Hub location problems with price sensitive demands ⋮ Costly circuits, submodular schedules and approximate Carathéodory theorems ⋮ A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ Separable convexification and DCA techniques for capacity and flow assignment problems ⋮ A conic quadratic formulation for a class of convex congestion functions in network flow problems ⋮ A tabu search algorithm for the routing and capacity assignment problem in computer networks ⋮ Convexity and optimization with copulæ structured probabilistic constraints ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité

This page was built for publication: Capacity and flow assignment of data networks by generalized Benders decomposition