Journal: Computers & OR

Volume 40, Issue 1

1 -- 8Shuangyuan Yang, Shuihua Han, Weiguo Ye. A simple randomized algorithm for two-dimensional strip packing
9 -- 23Yonghan Feng, Sarah M. Ryan. Scenario construction and reduction applied to stochastic power generation expansion planning
24 -- 32Alexander J. Benavides, Marcus Ritt, Luciana S. Buriol, Paulo M. França. An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
33 -- 46Jing Xiao, Xian-Ting Ao, Yong Tang. Solving software project scheduling problems with ant colony optimization
47 -- 57Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic. Variable neighborhood search for location routing
58 -- 69E. Specht. High density packings of equal circles in rectangles with variable aspect ratio
70 -- 79John Willmer Escobar, Rodrigo Linfati, Paolo Toth. A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
80 -- 90Grit Claßen, Arie M. C. A. Koster, Anke Schmeink. A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
91 -- 97John J. Kanet, C. Birkemeier. Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity
98 -- 108Nils Boysen, Michael Zenker. A decomposition approach for the car resequencing problem with selectivity banks
109 -- 116Enrique Gerstl, Gur Mosheiov. Scheduling problems with two competing agents to minimized weighted earliness-tardiness
117 -- 128Quan-ke Pan, Rubén Ruiz. A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
129 -- 136Ravi Kothari, Diptesh Ghosh. Insertion based Lin-Kernighan heuristic for single row facility layout
137 -- 149Rafael Martí, Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo. Branch and bound for the cutwidth minimization problem
150 -- 165Emilio Carrizosa, Dolores Romero Morales. Supervised classification and mathematical optimization
166 -- 179Qinghua Wu, Jin-Kao Hao. Memetic search for the max-bisection problem
180 -- 191Feifeng Zheng, Yongxi Cheng, Ming Liu, Yinfeng Xu. Online interval scheduling on a single machine with finite lookahead
192 -- 206Una Benlic, Jin-Kao Hao. Breakout Local Search for maximum clique problems
207 -- 213Amir Salehipour, Mohammad Modarres, Leila Moslemi Naeni. An efficient hybrid meta-heuristic for aircraft landing problem
214 -- 224Duygu Tas, Nico P. Dellaert, Tom Van Woensel, Ton de Kok. Vehicle routing problem with stochastic travel times including soft time windows and service costs
225 -- 235Azadeh Mobasher, Ali Ekici. Solution approaches for the cutting stock problem with setup cost
236 -- 247M. T. Yazdani Sabouni, Rasaratnam Logendran. A single machine carryover sequence-dependent group scheduling in PCB manufacturing
248 -- 252Shuyu Zhou, Zhaohui Liu. A theoretical development for the total tardiness problem and its application in branch and bound algorithms
253 -- 263Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau. Heuristics for dynamic and stochastic routing in industrial shipping
264 -- 272Nabil Absi, Boris Detienne, Stéphane Dauzère-Pérès. Heuristics for the multi-item capacitated lot-sizing problem with lost sales
273 -- 281Rosario Giuseppe Garroppo, Stefano Giordano, Gianfranco Nencioni, Maria Grazia Scutellà. Mixed Integer Non-Linear Programming models for Green Network Design
282 -- 302Xiang Li, Gang Du. BSTBGA: A hybrid genetic algorithm for constrained multi-objective optimization problems
303 -- 317Florian Seeanner, Bernardo Almada-Lobo, Herbert Meyr. Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems
318 -- 327Adam Ouorou. Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
328 -- 343Benjamin J. Lobo, Thom J. Hodgson, Russell E. King, Kristin A. Thoney, James R. Wilson. max in a worker-constrained job shop
344 -- 352Shunji Tanaka, Mituhiko Araki. An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
353 -- 361T. C. Edwin Cheng, Yu-Hsiang Chung, Shan-Ci Liao, Wen-Chiung Lee. Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
362 -- 377Laureano F. Escudero, María Araceli Garín, Gloria Pérez, Aitziber Unzueta. Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
378 -- 384Leonardo Lozano, Andrés L. Medaglia. On an exact method for the constrained shortest path problem
385 -- 394Xiaoyan Zhu, Wilbert E. Wilhelm. Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
395 -- 405Mohammad Ranjbar, Morteza Davari. An exact method for scheduling of the alternative technologies in R&D projects
406 -- 417Jianxun Tang, Lixin Tang, Xianpeng Wang. Solution method for the location planning problem of logistics park with variable capacity
418 -- 426Özcan Mutlu, Olcay Polat, Aliye Ayca Supciller. An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II
427 -- 437Jack Brimberg, Zvi Drezner. A new heuristic for solving the p-median problem in the plane
438 -- 450Shijin Wang, Ming Liu. A heuristic method for two-stage hybrid flow shop with dedicated machines
451 -- 462Yueni Zhu, Zheng Zheng, Xiaoyi Zhang, Kai-Yuan Cai. The r-interdiction median problem with probabilistic protection and its solution algorithm
463 -- 474Krzysztof Fleszar. Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
475 -- 489Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, Christian Prins. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
490 -- 497Sophie N. Parragh, Verena Schmid. Hybrid column generation and large neighborhood search for the dial-a-ride problem
498 -- 509Thomas Vincent, Florian Seipp, Stefan Ruzika, Anthony Przybylski, Xavier Gandibleux. Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
510 -- 519S. R. Chakravarthy, Helen D. Karatza. Two-server parallel system with pure space sharing and Markovian arrivals
520 -- 0Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo. Addendum to the paper entitled "A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon"