Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm

DOI10.1016/j.cor.2023.106292OpenAlexW4379012092MaRDI QIDQ6106600

Pedro Augusto Munari, Cezar Antônio Rigo, Laio Oriel Seman, Eduardo Camponogara, Eduardo Augusto Bezerra

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106292

zbMATH Keywords

schedulingDantzig-Wolfe decompositionquality of servicenanosatellitebranch cut and price

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Using the primal-dual interior point algorithm within the branch-price-and-cut method
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• Branching rules revisited
• New developments in the primal-dual column generation technique
• A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service
• A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Reformulation and Decomposition of Integer Programs
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• Selected Topics in Column Generation

This page was built for publication: Improving energy aware nanosatellite task scheduling by a branch-cut-and-price algorithm