default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 52
Volume 52, Part A, December 2014
- Marc Goerigk
, Anita Schöbel:
Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling. 1-15 - Mouna Kchaou Boujelben, Céline Gicquel, Michel Minoux:
A distribution network design problem in the automotive industry: MIP formulation and heuristics. 16-28 - Árton P. Dorneles, Olinto César Bassi de Araújo, Luciana S. Buriol:
A fix-and-optimize heuristic for the high school timetabling problem. 29-38 - Duygu Tas, Ola Jabali, Tom Van Woensel:
A Vehicle Routing Problem with Flexible Time Windows. 39-54 - Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte:
Heuristics for dynamic and stochastic inventory-routing. 55-67 - Niraj Ramesh Dayama, Mohan Krishnamoorthy, Andreas T. Ernst, Vishnu Narayanan, Narayan Rangaraj:
Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations. 68-83 - Canrong Zhang, Tao Wu, Ming Zhong, Li Zheng, Lixin Miao:
Location assignment for outbound containers with adjusted weight proportion. 84-93 - Maria Teresa Almeida, Filipa Duarte de Carvalho:
Two-phase heuristics for the k-club problem. 94-104 - Veena Adlakha, Krzysztof Kowalski:
On lower bounds for the fixed charge problem. 105-112 - Stephen E. Wright, Byran J. Smucker:
Rapid calculation of exact cell bounds for contingency tables from conditional frequencies. 113-122 - Zahnupriya Kalita, Dilip Datta:
Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm. 123-134 - Stanislaw Gawiejnowicz, Cezary Suwalski:
Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria. 135-146
Volume 52, Part B, December 2014
- Nenad Mladenovic, Saïd Salhi, Saïd Hanafi, Jack Brimberg:
Editorial. 147-148 - Neda Karimi, Hamid Davoudpour:
A high performing metaheuristic for multi-objective flowshop scheduling problem. 149-156 - Darko Kovacevic, Nenad Mladenovic, Bratislav Petrovic, Pavle D. Milosevic:
DE-VNS: Self-adaptive Differential Evolution with crossover neighborhood search for continuous global optimization. 157-169 - Barrett W. Thomas, Emanuele Manni:
Scheduled penalty Variable Neighborhood Search. 170-180 - Javad Behnamian:
Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation. 181-191 - Marko S. Djogatovic, Milorad J. Stanojevic, Nenad Mladenovic:
A variable neighborhood search particle filter for bearings-only target tracking. 192-202 - George H. G. Fonseca, Haroldo G. Santos:
Variable Neighborhood Search based algorithms for high school timetabling. 203-208 - Jesús Sánchez-Oro, Juan José Pantrigo, Abraham Duarte:
Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem. 209-219 - Fabián Castaño, André Rossi, Marc Sevaux, Nubia Velasco:
A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints. 220-230 - Emilio Carrizosa, Jelena Jockovic, Pepa Ramírez-Cobo:
A global optimisation approach for parameter estimation of a mixture of double Pareto lognormal and lognormal distributions. 231-240 - Yiyong Xiao, Yun Tian, Qiuhong Zhao:
Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search. 241-250 - Behnaz Saboonchi, Pierre Hansen, Sylvain Perron:
MaxMinMin p-dispersion problem: A variable neighborhood search approach. 251-259 - Ghasem Moslehi, Danial Khorasanian:
A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. 260-268 - Slim Belhaiza, Pierre Hansen, Gilbert Laporte:
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. 269-281 - Thanh-Ha Nguyen, Mike Wright:
Variable neighborhood search for the workload balancing problem in service enterprises. 282-290 - Anis Mjirda, Bassem Jarboui, Rita Macedo, Saïd Hanafi, Nenad Mladenovic:
A two phase variable neighborhood search for the multi-product inventory routing problem. 291-299 - Majid Eskandarpour, Ehsan Nikbakhsh, Seyed Hessameddin Zegordi:
Variable neighborhood search for the bi-objective post-sales network design problem: A fitness landscape analysis approach. 300-314 - Saïd Salhi, Arif Imran, Niaz A. Wassan:
The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. 315-325 - Frank Plastria, Emilio Carrizosa, José Gordillo:
Multi-instance classification through spherical separation and VNS. 326-333 - Ivan A. Davydov, Yury Kochetov, Emilio Carrizosa:
A local search heuristic for the (r|p)-centroid problem in the plane. 334-340 - Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic:
Two level General variable neighborhood search for Attractive traveling salesman problem. 341-348 - Emilio Carrizosa, Vanesa Guerrero:
rs-Sparse principal component analysis: A mixed integer nonlinear programming approach with VNS. 349-354
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.
last updated on 2026-03-28 22:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
