IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i6piii-iv.html

Note from the Editor

Author

Listed:
  • Alice E. Smith

    (Department of Industrial and Systems Engineering, Auburn University, Auburn, Alabama 36849)

Abstract

No abstract is available for this item.

Suggested Citation

  • Alice E. Smith, 2025. "Note from the Editor," INFORMS Journal on Computing, INFORMS, vol. 37(6), pages 1-1, November.
    • Handle: RePEc:inm:orijoc:v:37:y:2025:i:6:p:iii-iv
    DOI: 10.1287/ijoc.2025.ed.v37.n6
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2025.ed.v37.n6
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2025.ed.v37.n6?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
    ---><---

    References listed on IDEAS

    as
    1. Edward Rothberg, 2007. "An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 534-541, November.
    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. Pedro Henrique Liguori & A. Ridha Mahjoub & Guillaume Marques & Ruslan Sadykov & Eduardo Uchoa, 2023. "Nonrobust Strong Knapsack Cuts for Capacitated Location Routing and Related Problems," Operations Research, INFORMS, vol. 71(5), pages 1577-1595, September.
    2. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2021. "Weighted proximity search," Journal of Heuristics, Springer, vol. 27(3), pages 459-496, June.
    3. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.
    4. Diana Ramirez-Rios & Angelo Soto-Vergel & Trilce Encarnacion & Johanna Amaya, 2025. "A Location-Allocation Model for Food Distribution in Post-Disaster Environments," Networks and Spatial Economics, Springer, vol. 25(3), pages 757-791, September.
    5. Salgado-Rojas, José & Álvarez-Miranda, Eduardo & Hermoso, Virgilio, 2025. "A mixed integer programming approach to address cumulative threats in multi action management plans for biodiversity recovery," Omega, Elsevier, vol. 133(C).
    6. Adel Alfonso Mendoza Mendoza & Tom�s Jos� Fontalvo Herrera & Delimiro Alberto Visbal Cadavid, 2014. "Optimización multiobjetivo en una cadena de suministro," Revista Ciencias Estratégicas, Universidad Pontificia Bolivariana.
    7. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    8. Filipe Rodrigues & Agostinho Agra & Lars Magnus Hvattum & Cristina Requejo, 2022. "Weighted iterated local branching for mathematical programming problems with binary variables," Journal of Heuristics, Springer, vol. 28(3), pages 329-350, June.
    9. Kuo-Ling Huang & Sanjay Mehrotra, 2013. "An empirical evaluation of walk-and-round heuristics for mixed integer linear programs," Computational Optimization and Applications, Springer, vol. 55(3), pages 545-570, July.
    10. Stephen J. Maher, 2021. "Enhancing large neighbourhood search heuristics for Benders’ decomposition," Journal of Heuristics, Springer, vol. 27(4), pages 615-648, August.
    11. Clautiaux, François & Ljubić, Ivana, 2025. "Last fifty years of integer linear programming: A focus on recent practical advances," European Journal of Operational Research, Elsevier, vol. 324(3), pages 707-731.
    12. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
    13. Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao, 2018. "Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs," Computational Optimization and Applications, Springer, vol. 69(1), pages 1-24, January.
    14. Guillaume Marques & Ruslan Sadykov & Rémy Dupas & Jean-Christophe Deschamps, 2022. "A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 56(6), pages 1598-1617, November.
    15. Akkan, Can & Erdem Külünk, M. & Koçaş, Cenk, 2016. "Finding robust timetables for project presentations of student teams," European Journal of Operational Research, Elsevier, vol. 249(2), pages 560-576.
    16. Pietro Tiaraju Giavarina dos Santos & Denis Borenstein, 2025. "Combined cargo allocation and multi-ship routing and scheduling problem: application in the fertilizer industry," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(1), pages 29-55, April.
    17. Álvarez-Miranda, Eduardo & Cacchiani, Valentina & Lodi, Andrea & Parriani, Tiziano & Schmidt, Daniel R., 2014. "Single-commodity robust network design problem: Complexity, instances and heuristic solutions," European Journal of Operational Research, Elsevier, vol. 238(3), pages 711-723.
    18. David F. Koza & Guy Desaulniers & Stefan Ropke, 2020. "Integrated Liner Shipping Network Design and Scheduling," Transportation Science, INFORMS, vol. 54(2), pages 512-533, March.

    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:inm:orijoc:v:37:y:2025:i:6:p:iii-iv. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.