Solving the swath segment selection problem through Lagrangean relaxation

DOI10.1016/j.cor.2006.04.005zbMath1278.90333OpenAlexW2090740707MaRDI QIDQ2456644

Federico Gandellini, Giovanni Righini, Roberto Cordone

Publication date: 19 October 2007

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

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

zbMATH Keywords

combinatorial optimizationLagrangean relaxationEarth observation satellites

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Upper bounds for the SPOT 5 daily photograph scheduling problem
• Two exact algorithms for the capacitated \(p\)-median problem
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Validation of subgradient optimization
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite