Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
DOI10.1016/J.EJOR.2004.10.026zbMATH Open1111.90357OpenAlexW2024164701MaRDI QIDQ2488902FDOQ2488902
Authors: Leslie O. Morgan, Alysse R. Morton, Richard L. Daniels
Publication date: 16 May 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.10.026
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A hybrid approach for optimization of one-dimensional cutting
- A sequential heuristic procedure for one-dimensional cutting
- A simulated annealing heuristic for the one-dimensional cutting stock problem
Cited In (3)
This page was built for publication: Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488902)