Multi-period traffic routing in satellite networks
From MaRDI portal
Publication:1926695
DOI10.1016/j.ejor.2011.11.004zbMath1253.90065OpenAlexW2112292720MaRDI 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
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Case-oriented studies in operations research (90B90)
Related Items (3)
A look at the past and present of optimization - an editorial ⋮ Optimal design of line replaceable units ⋮ Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances
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
This page was built for publication: Multi-period traffic routing in satellite networks
