var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Felvcastelo.github.io%2Fassets%2Fpubs.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Felvcastelo.github.io%2Fassets%2Fpubs.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Felvcastelo.github.io%2Fassets%2Fpubs.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Valid inequalities for the k-Color Shortest Path Problem.\n \n \n \n \n\n\n \n de Andrade , R. C.; Castelo, E. E. S.; and Saraiva, R. D.\n\n\n \n\n\n\n European Journal of Operational Research, 315(2): 499-510. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ValidPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n 
@article{DEANDRADE2024499,\ntitle = {Valid inequalities for the k-Color Shortest Path Problem},\njournal = {European Journal of Operational Research},\nvolume = {315},\nnumber = {2},\npages = {499-510},\nyear = {2024},\nissn = {0377-2217},\ndoi = {https://doi.org/10.1016/j.ejor.2023.12.014},\nurl = {https://www.sciencedirect.com/science/article/pii/S0377221723009487},\nauthor = {Rafael Castro {de Andrade} and Emanuel Elias Silva Castelo and Rommel Dias Saraiva},\nkeywords = {Combinatorial optimization, -color shortest path problem, Valid inequalities},\nabstract = {Given a digraph D=(V,A) where each arc (i,j)∈A has a cost dij∈R+ and a color c(i,j), a positive integer k, and vertices s,t∈V, the k-Color Shortest Path Problem consists in finding a path from s to t of minimum cost while using at most k distinct arc colors. We propose valid inequalities for the problem that proved to strengthen the linear relaxation of an existing Integer Linear Programming formulation for the problem. One exponential set of valid inequalities defines a new formulation for the problem that is solved by using a branch-and-cut algorithm. We introduce more challenging instances for the problem and present numerical experiments for both the benchmark and the new instances. Finally, we evaluate the individual and the collective use of the valid inequalities. Computational results for the proposed ideas and for existing solution approaches for the problem showed the effectiveness of the new inequalities in handling the new instances, both in terms of execution times and improvement of the linear relaxed solutions.}\n}
\n
\n\n\n
\n Given a digraph D=(V,A) where each arc (i,j)∈A has a cost dij∈R+ and a color c(i,j), a positive integer k, and vertices s,t∈V, the k-Color Shortest Path Problem consists in finding a path from s to t of minimum cost while using at most k distinct arc colors. We propose valid inequalities for the problem that proved to strengthen the linear relaxation of an existing Integer Linear Programming formulation for the problem. One exponential set of valid inequalities defines a new formulation for the problem that is solved by using a branch-and-cut algorithm. We introduce more challenging instances for the problem and present numerical experiments for both the benchmark and the new instances. Finally, we evaluate the individual and the collective use of the valid inequalities. Computational results for the proposed ideas and for existing solution approaches for the problem showed the effectiveness of the new inequalities in handling the new instances, both in terms of execution times and improvement of the linear relaxed solutions.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);