Matheuristics approaches for the satellite constellation design problem
From MaRDI portal
Publication:6572734
Recommendations
- Mixed integer (non)linear approaches for the satellite constellation design problem
- scientific article; zbMATH DE number 1859292
- Optimization of satellite constellations
- Judgement theorems and an approach for solving the constellation-to-ground coverage problem
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
Cites work
- A feasibility pump for mixed integer nonlinear programs
- A feasibility pump heuristic for general mixed-integer problems
- A new class of functions for measuring solution integrality in the feasibility pump approach
- A storm of feasibility pumps for nonconvex MINLP
- Boosting the feasibility pump
- Feasibility pump 2.0
- Feasibility Pump-like heuristics for mixed integer problems
- Heuristics for convex mixed integer nonlinear programs
- Improving the feasibility pump
- Inexact feasibility pump for mixed integer nonlinear programming
- Mixed integer (non)linear approaches for the satellite constellation design problem
- On interval-subgradient and no-good cuts
- On Projection Algorithms for Solving Convex Feasibility Problems
- Ten years of feasibility pump, and counting
- The feasibility pump
- Three ideas for a feasibility pump for nonconvex MINLP
- Towards an objective feasibility pump for convex minlps
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
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)