IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v146y2003i3p486-497.html
   My bibliography  Save this article

Flight test data cycle map optimisation

Author

Listed:
  • Panton, David
  • John, Maria
  • Lucas, Stephen
  • Mason, Andrew

Abstract

No abstract is available for this item.

Suggested Citation

  • Panton, David & John, Maria & Lucas, Stephen & Mason, Andrew, 2003. "Flight test data cycle map optimisation," European Journal of Operational Research, Elsevier, vol. 146(3), pages 486-497, May.
    • Handle: RePEc:eee:ejores:v:146:y:2003:i:3:p:486-497
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00232-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ali, Agha Iqbal & O'Connor, Debra J., 2010. "The impact of distribution system characteristics on computational tractability," European Journal of Operational Research, Elsevier, vol. 200(2), pages 323-333, January.
    2. Oguz, Osman, 2010. "Cutting plane algorithms for 0-1 programming based on cardinality cuts," European Journal of Operational Research, Elsevier, vol. 205(2), pages 273-279, September.
    3. Domenech, B & Lusa, A, 2016. "A MILP model for the teacher assignment problem considering teachers’ preferences," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1153-1160.
    4. Nwana, V. & Darby-Dowman, K. & Mitra, G., 2005. "A co-operative parallel heuristic for mixed zero-one linear programming: Combining simulated annealing with branch and bound," European Journal of Operational Research, Elsevier, vol. 164(1), pages 12-23, July.
    5. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    6. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    7. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    8. Zhan, Junpeng & Ansari, Osama Aslam & Liu, Weijia & Chung, C.Y., 2019. "An accurate bilinear cavern model for compressed air energy storage," Applied Energy, Elsevier, vol. 242(C), pages 752-768.
    9. Manur, Ashray & Venkataramanan, Giri & Sehloff, David, 2018. "Simple electric utility platform: A hardware/software solution for operating emergent microgrids," Applied Energy, Elsevier, vol. 210(C), pages 748-763.
    10. Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
    11. M T Ramos & J Sáez, 2005. "Solving capacitated facility location problems by Fenchel cutting planes," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 297-306, March.
    12. Sangbum Lee & Ignacio Grossmann, 2005. "Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems," Annals of Operations Research, Springer, vol. 139(1), pages 267-288, October.
    13. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    14. Lee, L. H. & Chew, E. P. & Ng, T. S., 2005. "Production planning with approved vendor matrices for a hard-disk drive manufacturer," European Journal of Operational Research, Elsevier, vol. 162(2), pages 310-324, April.
    15. Tsai, Jung-Fa & Lin, Ming-Hua & Hu, Yi-Chung, 2008. "Finding multiple solutions to general integer linear programs," European Journal of Operational Research, Elsevier, vol. 184(2), pages 802-809, January.
    16. Daniel Dadush & Santanu S. Dey & Juan Pablo Vielma, 2011. "The Chvátal-Gomory Closure of a Strictly Convex Body," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 227-239, May.
    17. Ha, Chunghun & Kuo, Way, 2006. "Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems," European Journal of Operational Research, Elsevier, vol. 171(1), pages 24-38, May.
    18. Guglielmo Lulli & Suvrajeet Sen, 2004. "A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems," Management Science, INFORMS, vol. 50(6), pages 786-796, June.
    19. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    20. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Teresa Ortuno, M., 2003. "BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs," European Journal of Operational Research, Elsevier, vol. 151(3), pages 503-519, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:146:y:2003:i:3:p:486-497. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.