<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
<record>
  <controlfield tag="001">79083</controlfield>
  <controlfield tag="005">20220208112845.0</controlfield>
  <datafield tag="024" ind1="7" ind2=" ">
    <subfield code="2">doi</subfield>
    <subfield code="a">10.1016/j.ejor.2018.02.041</subfield>
  </datafield>
  <datafield tag="024" ind1="8" ind2=" ">
    <subfield code="2">sideral</subfield>
    <subfield code="a">106378</subfield>
  </datafield>
  <datafield tag="037" ind1=" " ind2=" ">
    <subfield code="a">ART-2018-106378</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Calvete, H.I.</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-7603-9380</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Dealing with residual energy when transmitting data in energy-constrained capacitated networks</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018</subfield>
  </datafield>
  <datafield tag="506" ind1="0" ind2=" ">
    <subfield code="a">Access copy available to the general public</subfield>
    <subfield code="f">Unrestricted</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
    <subfield code="a">This paper addresses several problems relating to the energy available after the transmission of a given amount of data in a capacitated network. The arcs have an associated parameter representing the energy consumed during the transmission along the arc and the nodes have limited power to transmit data. In the first part of the paper, we consider the problem of designing a path which maximizes the minimum of the residual energy remaining at the nodes. After formulating the problem and proving the main theoretical results, a polynomial time algorithm is proposed based on computing maxmin paths in a sequence of non-capacitated networks. In the second part of the paper, the problem of obtaining a quickest path in this context is analyzed. First, the bi-objective variant of this problem is considered in which we aim to minimize the transmission time and to maximize the minimum residual energy. An exact polynomial time algorithm is proposed to find a minimal complete set of efficient solutions which amounts to solving shortest path problems. Second, the problem of computing an energy-constrained quickest path which guarantees at least a given residual energy at the nodes is reformulated as a variant of the energy-constrained quickest path problem. The algorithms are tested on a set of benchmark problems providing the optimal solution or the Pareto front within reasonable computing times.</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/grantAgreement/ES/DGA-FSE/E58</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
    <subfield code="a">by-nc-nd</subfield>
    <subfield code="u">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</subfield>
  </datafield>
  <datafield tag="590" ind1=" " ind2=" ">
    <subfield code="a">3.806</subfield>
    <subfield code="b">2018</subfield>
  </datafield>
  <datafield tag="591" ind1=" " ind2=" ">
    <subfield code="a">OPERATIONS RESEARCH &amp; MANAGEMENT SCIENCE</subfield>
    <subfield code="b">13 / 84 = 0.155</subfield>
    <subfield code="c">2018</subfield>
    <subfield code="d">Q1</subfield>
    <subfield code="e">T1</subfield>
  </datafield>
  <datafield tag="592" ind1=" " ind2=" ">
    <subfield code="a">2.205</subfield>
    <subfield code="b">2018</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Computer Science (miscellaneous)</subfield>
    <subfield code="c">2018</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Modeling and Simulation</subfield>
    <subfield code="c">2018</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Management Science and Operations Research</subfield>
    <subfield code="c">2018</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="593" ind1=" " ind2=" ">
    <subfield code="a">Information Systems and Management</subfield>
    <subfield code="c">2018</subfield>
    <subfield code="d">Q1</subfield>
  </datafield>
  <datafield tag="655" ind1=" " ind2="4">
    <subfield code="a">info:eu-repo/semantics/article</subfield>
    <subfield code="v">info:eu-repo/semantics/acceptedVersion</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">del-Pozo, L.</subfield>
    <subfield code="u">Universidad de Zaragoza</subfield>
    <subfield code="0">(orcid)0000-0001-8686-3963</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Iranzo, J.A.</subfield>
    <subfield code="0">(orcid)0000-0001-9993-9816</subfield>
  </datafield>
  <datafield tag="710" ind1="2" ind2=" ">
    <subfield code="1">2007</subfield>
    <subfield code="2">265</subfield>
    <subfield code="a">Universidad de Zaragoza</subfield>
    <subfield code="b">Dpto. Métodos Estadísticos</subfield>
    <subfield code="c">Área Estadís. Investig. Opera.</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="g">269, 2 (2018), 602-620</subfield>
    <subfield code="p">Eur. J. oper. res.</subfield>
    <subfield code="t">European Journal of Operational Research</subfield>
    <subfield code="x">0377-2217</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">968912</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/79083/files/texto_completo.pdf</subfield>
    <subfield code="y">Postprint</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">46775</subfield>
    <subfield code="u">http://zaguan.unizar.es/record/79083/files/texto_completo.jpg?subformat=icon</subfield>
    <subfield code="x">icon</subfield>
    <subfield code="y">Postprint</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zaguan.unizar.es:79083</subfield>
    <subfield code="p">articulos</subfield>
    <subfield code="p">driver</subfield>
  </datafield>
  <datafield tag="951" ind1=" " ind2=" ">
    <subfield code="a">2022-02-08-11:23:45</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">ARTICLE</subfield>
  </datafield>
</record>
</collection>