Multi-period traffic routing in satellite networks

DOI10.1016/j.ejor.2011.11.004zbMath1253.90065MaRDI QIDQ1926695

S. Raghu Raghavan, Ioannis Gamvros

Publication date: 29 December 2012

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.004

zbMATH Keywords

integer programming; routing; large scale optimization; OR in telecommunications; branch-and-price-and-cut

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B18: Communication networks in operations research

90B90: Case-oriented studies in operations research

Related Items

Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances, A look at the past and present of optimization - an editorial

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for IP column generation
• A branch-and-cut algorithm for capacitated network design problems
• Some approaches to solving a multihour broadband network capacity design problem with single-path routing
• Sequence independent lifting in mixed integer programming
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
• Multiperiod network design with incremental routing
• The network redesign problem for access telecommunications networks
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Column Generation
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
• Capacitated Network Design—Polyhedral Structure and Computation