document.getElementById('index-articles-list').innerHTML = `
  • Exact solution approaches for the discrete α-neighbor p-center problem

    Elisabeth Gaar,Markus Sinnl

    Networks (New York, NY). 2023 Dec;82(4):371-399. DOI:10.1002/net.22162

  • Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs

    Georg E A Fröhlich,Karl F Doerner,Margaretha Gansterer

    Networks (New York, NY). 2020 Dec;76(4):431-450. DOI:10.1002/net.21993

  • The cost of incentive compatibility in auction-based mechanisms for carrier collaboration

    Margaretha Gansterer,Richard F Hartl,Rudolf Vetschera

    Networks (New York, NY). 2019 Jun;73(4):490-514. DOI:10.1002/net.21828

  • The school bus routing and scheduling problem with transfers
    带换乘的校车路线上下学问题

    Michael Bögl,Karl F Doerner,Sophie N Parragh

    Networks (New York, NY). 2015 Mar;65(2):180-203. DOI:10.1002/net.21589

  • `; document.getElementById('index-articles-more').href = `https://i.iikx.com/journal/0028-3045.html`; document.getElementById('index-articles-more').innerHTML='更多内容'; document.getElementById('index-articles-more').style="float:right;background:var(--primary-color);color:#fff;font-size:13px;border-radius:5px;padding:0px 10px;margin-right:5px;line-height:1.7"; document.getElementsByClassName('index-artcles')[0].style.display = 'block'; document.getElementById('showJournalIndexUrl').style.display = 'block'; document.querySelector('#showJournalIndexUrl a').href = `https://i.iikx.com/journal/0028-3045.html`;