Price-directive decomposition applied to routing in telecommunication networks

DOI10.1016/0377-2217(94)00365-3zbMath0920.90062OpenAlexW1970879404MaRDI QIDQ1278255

Fátima G. Ayllón, Jorge E. Galán, Angel N. Menendez, ángel G. Marín

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00365-3

zbMATH Keywords

Dantzig-Wolfe decompositionprice-directive decompositionrouting-grouping problemtransmission-telecommunication networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for network dimensioning under reliability considerations
• Decomposition Principle for Linear Programs
• Large-scale linear programming: Geometry, working bases and factorizations
• A dantzig-wolfe decomposition variant equivalent to basis factorization
• Algorithms for Multiplex Bundling in a Telecommunications Network
• Disjoint paths in a network
• The all-to-all alternative route problem