default search action
Search dblp for Publications
export results for "toc:db/journals/cor/cor63.bht:"
@article{DBLP:journals/cor/AzadehMS15, author = {Shadi Sharif Azadeh and Patrice Marcotte and Gilles Savard}, title = {A non-parametric approach to demand forecasting in revenue management}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {23--31}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.03.015}, doi = {10.1016/J.COR.2015.03.015}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/AzadehMS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/CaboPPS15, author = {Marta Cabo and Edgar Possani and Chris N. Potts and Xiang Song}, title = {Split-merge: Using exponential neighborhood search for scheduling a batching machine}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {125--135}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.017}, doi = {10.1016/J.COR.2015.04.017}, timestamp = {Mon, 26 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/CaboPPS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/ErgezerS15, author = {Mehmet Ergezer and Dan Simon}, title = {Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {114--124}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.03.013}, doi = {10.1016/J.COR.2015.03.013}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/ErgezerS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/FiorottoAJ15, author = {Diego Jacinto Fiorotto and Silvio Alexandre de Araujo and Raf Jans}, title = {Hybrid methods for lot sizing on parallel machines}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {136--148}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.015}, doi = {10.1016/J.COR.2015.04.015}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/FiorottoAJ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/GouveiaR15, author = {Luis Eduardo Neves Gouveia and Mario Ruthmair}, title = {Load-dependent and precedence-based models for pickup and delivery problems}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {56--71}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.008}, doi = {10.1016/J.COR.2015.04.008}, timestamp = {Mon, 21 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cor/GouveiaR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/GueK15, author = {Kevin R. Gue and Hyun Ho Kim}, title = {An approximation model for sojourn time distributions in acyclic multi-server queueing networks}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {46--55}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.019}, doi = {10.1016/J.COR.2015.04.019}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/GueK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/IoriR15, author = {Manuel Iori and Jorge Riera{-}Ledesma}, title = {Exact algorithms for the double vehicle routing problem with multiple stacks}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {83--101}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.016}, doi = {10.1016/J.COR.2015.04.016}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/IoriR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/KangC15, author = {Changmuk Kang and Byung{-}Cheon Choi}, title = {An adaptive crashing policy for stochastic time-cost tradeoff problems}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {1--6}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.021}, doi = {10.1016/J.COR.2015.04.021}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/KangC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/KongGOL15, author = {Xiangyong Kong and Liqun Gao and Haibin Ouyang and Steven Li}, title = {Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {7--22}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.018}, doi = {10.1016/J.COR.2015.04.018}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/KongGOL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/MartelloM15, author = {Silvano Martello and Michele Monaci}, title = {Models and algorithms for packing rectangles into the smallest square}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {161--171}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.024}, doi = {10.1016/J.COR.2015.04.024}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/MartelloM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/PereiraGC15, author = {Dilson Lucas Pereira and Michel Gendreau and Alexandre Salles da Cunha}, title = {Lower bounds and exact algorithms for the quadratic minimum spanning tree problem}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {149--160}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.020}, doi = {10.1016/J.COR.2015.04.020}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/PereiraGC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/Smith-MilesB15, author = {Kate Smith{-}Miles and Simon Bowly}, title = {Generating new test instances by evolving in instance space}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {102--113}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.022}, doi = {10.1016/J.COR.2015.04.022}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/Smith-MilesB15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/VazPFKS15, author = {Daniel Vaz and Lu{\'{\i}}s Paquete and Carlos M. Fonseca and Kathrin Klamroth and Michael Stiglmayr}, title = {Representation of the non-dominated set in biobjective discrete optimization}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {172--186}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.05.003}, doi = {10.1016/J.COR.2015.05.003}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/VazPFKS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/Veatch15, author = {Michael H. Veatch}, title = {Approximate linear programming for networks: Average cost bounds}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {32--45}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.014}, doi = {10.1016/J.COR.2015.04.014}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/Veatch15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/XiaoYZZG15, author = {Jing Xiao and Huasheng Yang and Canrong Zhang and Li Zheng and Jatinder N. D. Gupta}, title = {A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times}, journal = {Comput. Oper. Res.}, volume = {63}, pages = {72--82}, year = {2015}, url = {https://doi.org/10.1016/j.cor.2015.04.010}, doi = {10.1016/J.COR.2015.04.010}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/XiaoYZZG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.