![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/cor/cor93.bht:"
@article{DBLP:journals/cor/BulhoesSU18, author = {Teobaldo Bulh{\~{o}}es and Ruslan Sadykov and Eduardo Uchoa}, title = {A branch-and-price algorithm for the Minimum Latency Problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {66--78}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.016}, doi = {10.1016/J.COR.2018.01.016}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/BulhoesSU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/CoelhoV18, author = {Jos{\'{e}} Coelho and Mario Vanhoucke}, title = {An exact composite lower bound strategy for the resource-constrained project scheduling problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {135--150}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.017}, doi = {10.1016/J.COR.2018.01.017}, timestamp = {Tue, 15 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/CoelhoV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/DAmbrosioMM18, author = {Claudia D'Ambrosio and Silvano Martello and Luca Mencarelli}, title = {Relaxations and heuristics for the multiple non-linear separable knapsack problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {79--89}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2017.12.017}, doi = {10.1016/J.COR.2017.12.017}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/DAmbrosioMM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/FaddaPT18, author = {Edoardo Fadda and Guido Perboli and Roberto Tadei}, title = {Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {41--50}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.010}, doi = {10.1016/J.COR.2018.01.010}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/FaddaPT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/FischettiMS18, author = {Matteo Fischetti and Michele Monaci and Domenico Salvagnin}, title = {SelfSplit parallelization for mixed-integer linear programming}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {101--112}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.011}, doi = {10.1016/J.COR.2018.01.011}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/FischettiMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/Pereira18, author = {Jordi Pereira}, title = {The robust (minmax regret) assembly line worker assignment and balancing problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {27--40}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.009}, doi = {10.1016/J.COR.2018.01.009}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/Pereira18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/PereiraU18, author = {Armando Honorio Pereira and Sebasti{\'{a}}n Urrutia}, title = {Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {1--14}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.005}, doi = {10.1016/J.COR.2018.01.005}, timestamp = {Tue, 22 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/PereiraU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/PourDB18, author = {Shahrzad M. Pour and John H. Drake and Edmund K. Burke}, title = {A choice function hyper-heuristic framework for the allocation of maintenance tasks in Danish railways}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {15--26}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2017.09.011}, doi = {10.1016/J.COR.2017.09.011}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/PourDB18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/RestrepoGR18, author = {Maria I. Restrepo and Bernard Gendron and Louis{-}Martin Rousseau}, title = {Combining Benders decomposition and column generation for multi-activity tour scheduling}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {151--165}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.014}, doi = {10.1016/J.COR.2018.01.014}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/RestrepoGR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/SchwerdfegerW18, author = {Stefan Schwerdfeger and Rico Walter}, title = {Improved algorithms to minimize workload balancing criteria on identical parallel machines}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {123--134}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.018}, doi = {10.1016/J.COR.2018.01.018}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/SchwerdfegerW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/TilkI18, author = {Christian Tilk and Stefan Irnich}, title = {Combined column-and-row-generation for the optimal communication spanning tree problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {113--122}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.003}, doi = {10.1016/J.COR.2018.01.003}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/TilkI18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/UmetaniAY18, author = {Shunji Umetani and Masanao Arakawa and Mutsunori Yagiura}, title = {Relaxation heuristics for the set multicover problem with generalized upper bound constraints}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {90--100}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.007}, doi = {10.1016/J.COR.2018.01.007}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/UmetaniAY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/WeiZ18, author = {Mike Mingcheng Wei and Fuqiang Zhang}, title = {Recent research developments of strategic consumer behavior in operations management}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {166--176}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2017.12.005}, doi = {10.1016/J.COR.2017.12.005}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/WeiZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/ZubaranR18, author = {Tadeu K. Zubaran and Marcus Ritt}, title = {An effective heuristic algorithm for the partial shop scheduling problem}, journal = {Comput. Oper. Res.}, volume = {93}, pages = {51--65}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2018.01.015}, doi = {10.1016/J.COR.2018.01.015}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/ZubaranR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.