Matheuristics approaches for the satellite constellation design problem
From MaRDI portal
Publication:6572734
DOI10.1007/s11081-023-09834-8MaRDI QIDQ6572734
Luca Mencarelli, Julien Floquet, Frédéric Georges
Publication date: 16 July 2024
Published in: Optimization and Engineering (Search for Journal in Brave)
feasibility pumpmixed integer (non)linear programmingdiscontinuous coveragemission planning satellitesrevisit timesatellite constellation design
Cites Work
- Towards an objective feasibility pump for convex minlps
- Inexact feasibility pump for mixed integer nonlinear programming
- Heuristics for convex mixed integer nonlinear programs
- Boosting the feasibility pump
- On interval-subgradient and no-good cuts
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- A storm of feasibility pumps for nonconvex MINLP
- Ten years of feasibility pump, and counting
- Three ideas for a feasibility pump for nonconvex MINLP
- Feasibility Pump-like heuristics for mixed integer problems
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- On Projection Algorithms for Solving Convex Feasibility Problems
- Mixed integer (non)linear approaches for the satellite constellation design problem
This page was built for publication: Matheuristics approaches for the satellite constellation design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572734)
