IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v52y2012i4p855-868.html
   My bibliography  Save this article

Packing congruent hyperspheres into a hypersphere

Author

Listed:
  • Yuriy Stoyan
  • Georgiy Yaskov

Abstract

No abstract is available for this item.

Suggested Citation

  • Yuriy Stoyan & Georgiy Yaskov, 2012. "Packing congruent hyperspheres into a hypersphere," Journal of Global Optimization, Springer, vol. 52(4), pages 855-868, April.
    • Handle: RePEc:spr:jglopt:v:52:y:2012:i:4:p:855-868
    DOI: 10.1007/s10898-011-9716-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9716-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9716-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Gondzio, Jacek, 1995. "HOPDM (version 2.12) -- A fast LP solver based on a primal-dual interior point method," European Journal of Operational Research, Elsevier, vol. 85(1), pages 221-225, August.
    2. Yuriy Stoyan & Georgiy Yaskov, 2008. "Packing Identical Spheres into a Rectangular Parallelepiped," Springer Books, in: Andreas Bortfeldt & Jörg Homberger & Herbert Kopfer & Giselher Pankratz & Reinhard Strangmeier (ed.), Intelligent Decision Support, pages 47-67, Springer.
    3. Stoyan, Yu. & Chugay, A., 2009. "Packing cylinders and rectangular parallelepipeds with distances between them into a given region," European Journal of Operational Research, Elsevier, vol. 197(2), pages 446-455, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2017. "A nonlinear programming model with implicit variables for packing ellipsoids," Journal of Global Optimization, Springer, vol. 68(3), pages 467-499, July.
    2. E. G. Birgin & R. D. Lobato & J. M. Martínez, 2016. "Packing ellipsoids by nonlinear optimization," Journal of Global Optimization, Springer, vol. 65(4), pages 709-743, August.
    3. Josef Kallrath & Markus M. Frey, 2019. "Packing circles into perimeter-minimizing convex hulls," Journal of Global Optimization, Springer, vol. 73(4), pages 723-759, April.
    4. Vélez-Gallego, Mario C. & Teran-Somohano, Alejandro & Smith, Alice E., 2020. "Minimizing late deliveries in a truck loading problem," European Journal of Operational Research, Elsevier, vol. 286(3), pages 919-928.

    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. Cosmin G. Petra & Florian A. Potra, 2019. "A homogeneous model for monotone mixed horizontal linear complementarity problems," Computational Optimization and Applications, Springer, vol. 72(1), pages 241-267, January.
    2. Stojkovic, Nebojsa V. & Stanimirovic, Predrag S., 2001. "Two direct methods in linear programming," European Journal of Operational Research, Elsevier, vol. 131(2), pages 417-439, June.
    3. Gondzio, Jacek & Kouwenberg, Roy & Vorst, Ton, 2003. "Hedging options under transaction costs and stochastic volatility," Journal of Economic Dynamics and Control, Elsevier, vol. 27(6), pages 1045-1068, April.
    4. María Gonzalez-Lima & Aurelio Oliveira & Danilo Oliveira, 2013. "A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming," Computational Optimization and Applications, Springer, vol. 56(3), pages 573-597, December.
    5. Peter Kall & János Mayer, 2006. "Some insights into the solution algorithms for SLP problems," Annals of Operations Research, Springer, vol. 142(1), pages 147-164, February.
    6. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    7. Jacek Gondzio & Roy Kouwenberg, 2001. "High-Performance Computing for Asset-Liability Management," Operations Research, INFORMS, vol. 49(6), pages 879-891, December.
    8. Kypreos, Socrates, 2005. "Modeling experience curves in MERGE (model for evaluating regional and global effects)," Energy, Elsevier, vol. 30(14), pages 2721-2737.
    9. Spyros Kontogiorgis, 2000. "Practical Piecewise-Linear Approximation for Monotropic Optimization," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 324-340, November.
    10. Emmanuel Fragnière & Jacek Gondzio & Robert Sarkissian & Jean-Philippe Vial, 2000. "A Structure-Exploiting Tool in Algebraic Modeling Languages," Management Science, INFORMS, vol. 46(8), pages 1145-1158, August.
    11. Gondzio, Jacek & González-Brevis, Pablo & Munari, Pedro, 2013. "New developments in the primal–dual column generation technique," European Journal of Operational Research, Elsevier, vol. 224(1), pages 41-51.
    12. Stanimirovic, Predrag S. & Stojkovic, Nebojsa V. & Kovacevic-Vujcic, Vera V., 2005. "Stabilization of Mehrotra's primal-dual algorithm and its implementation," European Journal of Operational Research, Elsevier, vol. 165(3), pages 598-609, September.
    13. G. Al-Jeiroudi & J. Gondzio, 2009. "Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 231-247, May.
    14. Kouwenberg, Roy, 2001. "Scenario generation and stochastic programming models for asset liability management," European Journal of Operational Research, Elsevier, vol. 134(2), pages 279-292, October.
    15. J. Gondzio & F. N. C. Sobral, 2019. "Quasi-Newton approaches to interior point methods for quadratic problems," Computational Optimization and Applications, Springer, vol. 74(1), pages 93-120, September.
    16. Yiran Cui & Keiichi Morikuni & Takashi Tsuchiya & Ken Hayami, 2019. "Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning," Computational Optimization and Applications, Springer, vol. 74(1), pages 143-176, September.
    17. Tsionas, Mike G., 2020. "A coherent approach to Bayesian Data Envelopment Analysis," European Journal of Operational Research, Elsevier, vol. 281(2), pages 439-448.

    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:spr:jglopt:v:52:y:2012:i:4:p:855-868. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.