IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v66y2016i4d10.1007_s10898-016-0479-4.html
   My bibliography  Save this article

Journal of Global Optimization Best Paper Award for 2015

Author

Listed:
  • Sergiy Butenko

    (Texas A&M University)

Abstract

No abstract is available for this item.

Suggested Citation

  • Sergiy Butenko, 2016. "Journal of Global Optimization Best Paper Award for 2015," Journal of Global Optimization, Springer, vol. 66(4), pages 595-596, December.
    • Handle: RePEc:spr:jglopt:v:66:y:2016:i:4:d:10.1007_s10898-016-0479-4
    DOI: 10.1007/s10898-016-0479-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0479-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0479-4?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. Peter Dickinson & Janez Povh, 2015. "On an extension of Pólya’s Positivstellensatz," Journal of Global Optimization, Springer, vol. 61(4), pages 615-625, April.
    2. Andrei Patrascu & Ion Necoara, 2015. "Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization," Journal of Global Optimization, Springer, vol. 61(1), pages 19-46, January.
    3. Ralph Kearfott, 2015. "Some observations on exclusion regions in branch and bound algorithms," Journal of Global Optimization, Springer, vol. 62(2), pages 229-241, June.
    4. Kerstin Dächert & Kathrin Klamroth, 2015. "A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems," Journal of Global Optimization, Springer, vol. 61(4), pages 643-676, April.
    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. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    2. Kerstin Dächert & Ria Grindel & Elisabeth Leoff & Jonas Mahnkopp & Florian Schirra & Jörg Wenzel, 2022. "Multicriteria asset allocation in practice," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 349-373, June.
    3. Xiaolong Kuang & Bissan Ghaddar & Joe Naoum-Sawaya & Luis F. Zuluaga, 2019. "Alternative SDP and SOCP approximations for polynomial optimization," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(2), pages 153-175, June.
    4. Ion Necoara & Yurii Nesterov & François Glineur, 2017. "Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 227-254, April.
    5. Niu, Yi-Shuai & Júdice, Joaquim & Le Thi, Hoai An & Pham, Dinh Tao, 2019. "Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 95-113.
    6. Dingfei Jin & Guang Yang & Zhenghui Li & Haode Liu, 2019. "Sparse Recovery Algorithm for Compressed Sensing Using Smoothed l 0 Norm and Randomized Coordinate Descent," Mathematics, MDPI, vol. 7(9), pages 1-13, September.
    7. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    8. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    9. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
    10. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
    11. William Pettersson & Melih Ozlen, 2020. "Multiobjective Integer Programming: Synergistic Parallel Approaches," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 461-472, April.
    12. Javier Ferrer & Francisco Chicano & José Antonio Ortega-Toro, 2021. "CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines," Journal of Heuristics, Springer, vol. 27(1), pages 229-249, April.
    13. Dal Sasso, Veronica & Djeumou Fomeni, Franklin & Lulli, Guglielmo & Zografos, Konstantinos G., 2018. "Incorporating Stakeholders’ priorities and preferences in 4D trajectory optimization," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 594-609.
    14. Kerstin Dächert & Sauleh Siddiqui & Javier Saez-Gallego & Steven A. Gabriel & Juan Miguel Morales, 2019. "A Bicriteria Perspective on L-Penalty Approaches – a Corrigendum to Siddiqui and Gabriel’s L-Penalty Approach for Solving MPECs," Networks and Spatial Economics, Springer, vol. 19(4), pages 1199-1214, December.
    15. Konur, Dinçer & Campbell, James F. & Monfared, Sepideh A., 2017. "Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers," Omega, Elsevier, vol. 71(C), pages 46-65.
    16. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    17. Klamroth, Kathrin & Lacour, Renaud & Vanderpooten, Daniel, 2015. "On the representation of the search region in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 245(3), pages 767-778.
    18. Pham Thi Hoai & Hoai An Le Thi & Nguyen Canh Nam, 2021. "Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects," 4OR, Springer, vol. 19(1), pages 41-70, March.
    19. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
    20. Peter J. C. Dickinson & Janez Povh, 2019. "A new approximation hierarchy for polynomial conic optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 37-67, May.

    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:spr:jglopt:v:66:y:2016:i:4:d:10.1007_s10898-016-0479-4. 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.