Pages that link to "Item:Q5954665"

The following pages link to Capacity and flow assignment of data networks by generalized Benders decomposition (Q5954665):

Displaying 10 items.

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