Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 40
Volume 40, Number 1, January 2013
- Shuangyuan Yang, Shuihua Han, Weiguo Ye:
A simple randomized algorithm for two-dimensional strip packing. 1-8 - Yonghan Feng, Sarah M. Ryan
:
Scenario construction and reduction applied to stochastic power generation expansion planning. 9-23 - Alexander J. Benavides, Marcus Ritt, Luciana S. Buriol, Paulo Morelato França:
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks. 24-32 - Jing Xiao, Xian-Ting Ao, Yong Tang:
Solving software project scheduling problems with ant colony optimization. 33-46 - Bassem Jarboui, Houda Derbel, Saïd Hanafi, Nenad Mladenovic:
Variable neighborhood search for location routing. 47-57 - Eckehard Specht:
High density packings of equal circles in rectangles with variable aspect ratio. 58-69 - John Willmer Escobar, Rodrigo Linfati, Paolo Toth:
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. 70-79 - Grit Claßen, Arie M. C. A. Koster, Anke Schmeink:
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks. 80-90 - John J. Kanet, C. Birkemeier:
Weighted tardiness for the single machine scheduling problem: An examination of precedence theorem productivity. 91-97 - Nils Boysen, Michael Zenker:
A decomposition approach for the car resequencing problem with selectivity banks. 98-108 - Enrique Gerstl, Gur Mosheiov:
Scheduling problems with two competing agents to minimized weighted earliness-tardiness. 109-116 - Quan-Ke Pan, Rubén Ruiz:
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. 117-128 - Ravi Kothari, Diptesh Ghosh:
Insertion based Lin-Kernighan heuristic for single row facility layout. 129-136 - Rafael Martí, Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo:
Branch and bound for the cutwidth minimization problem. 137-149 - Emilio Carrizosa, Dolores Romero Morales:
Supervised classification and mathematical optimization. 150-165 - Qinghua Wu, Jin-Kao Hao:
Memetic search for the max-bisection problem. 166-179 - Feifeng Zheng, Yongxi Cheng, Ming Liu, Yinfeng Xu:
Online interval scheduling on a single machine with finite lookahead. 180-191 - Una Benlic, Jin-Kao Hao:
Breakout Local Search for maximum clique problems. 192-206 - Amir Salehipour, Mohammad Modarres, Leila Moslemi Naeni:
An efficient hybrid meta-heuristic for aircraft landing problem. 207-213 - Duygu Tas, Nico P. Dellaert, Tom Van Woensel, Ton de Kok:
Vehicle routing problem with stochastic travel times including soft time windows and service costs. 214-224 - Azadeh Mobasher, Ali Ekici:
Solution approaches for the cutting stock problem with setup cost. 225-235 - M. T. Yazdani Sabouni, Rasaratnam Logendran:
A single machine carryover sequence-dependent group scheduling in PCB manufacturing. 236-247 - Shuyu Zhou, Zhaohui Liu:
A theoretical development for the total tardiness problem and its application in branch and bound algorithms. 248-252 - Gregorio Tirado, Lars Magnus Hvattum, Kjetil Fagerholt, Jean-François Cordeau:
Heuristics for dynamic and stochastic routing in industrial shipping. 253-263 - Nabil Absi, Boris Detienne, Stéphane Dauzère-Pérès:
Heuristics for the multi-item capacitated lot-sizing problem with lost sales. 264-272 - Rosario Giuseppe Garroppo, Stefano Giordano, Gianfranco Nencioni, Maria Grazia Scutellà:
Mixed Integer Non-Linear Programming models for Green Network Design. 273-281 - Xiang Li, Gang Du:
BSTBGA: A hybrid genetic algorithm for constrained multi-objective optimization problems. 282-302 - Florian 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. 303-317 - Adam Ouorou:
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty. 318-327 - Benjamin J. Lobo, Thom J. Hodgson, Russell E. King, Kristin A. Thoney, James R. Wilson:
An effective lower bound on Lmax in a worker-constrained job shop. 328-343 - Shunji Tanaka, Mituhiko Araki:
An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. 344-352 - T. 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. 353-361 - Laureano 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. 362-377 - Leonardo Lozano, Andrés L. Medaglia:
On an exact method for the constrained shortest path problem. 378-384 - Xiaoyan Zhu, Wilbert E. Wilhelm:
Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price. 385-394 - Mohammad Ranjbar, Morteza Davari:
An exact method for scheduling of the alternative technologies in R&D projects. 395-405 - Jianxun Tang, Lixin Tang, Xianpeng Wang:
Solution method for the location planning problem of logistics park with variable capacity. 406-417 - Özcan Mutlu, Olcay Polat, Aliye Ayca Supciller:
An iterative genetic algorithm for the assembly line worker assignment and balancing problem of type-II. 418-426 - Jack Brimberg, Zvi Drezner:
A new heuristic for solving the p-median problem in the plane. 427-437 - Shijin Wang, Ming Liu:
A heuristic method for two-stage hybrid flow shop with dedicated machines. 438-450 - Yueni Zhu, Zheng Zheng, Xiaoyi Zhang, Kai-Yuan Cai:
The r-interdiction median problem with probabilistic protection and its solution algorithm. 451-462 - Krzysztof Fleszar:
Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. 463-474 - Thibaut 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. 475-489 - Sophie N. Parragh, Verena Schmid:
Hybrid column generation and large neighborhood search for the dial-a-ride problem. 490-497 - Thomas 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. 498-509 - S. R. Chakravarthy, Helen D. Karatza:
Two-server parallel system with pure space sharing and Markovian arrivals. 510-519 - Antonio 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". 520
Volume 40, Number 2, February 2013
- Gengcheng Liu, Shiji Song, Cheng Wu:
Some heuristics for no-wait flowshops with total tardiness criterion. 521-525 - Dan Black, Richard W. Eglese, Sanne Wøhlk:
The time-dependent prize-collecting arc routing problem. 526-535 - Ulrich Derigs, Markus Pullmann, Ulrich Vogel:
Truck and trailer routing - Problems, heuristics and computational experience. 536-546 - Ji-Bo Wang, Ming-Zheng Wang:
Minimizing makespan in three-machine flow shops with deteriorating jobs. 547-557 - Leandro C. Coelho, Gilbert Laporte:
The exact solution of several classes of inventory-routing problems. 558-565 - Jorge Riera-Ledesma, Juan José Salazar González:
A column generation approach for a school bus routing problem with resource constraints. 566-583 - Fabio Colombo, Marco Trubian:
A branch and price algorithm for the SS/TDMA problem with cardinality constraint. 584-593 - Lei Fang, Hecheng Li:
Duality and efficiency computations in the cost efficiency model with price uncertainty. 594-602 - Rym M'Hallah, Abdulaziz Alkandari, Nenad Mladenovic:
Packing unit spheres into the smallest sphere using VNS and NLP. 603-615 - Antonio Sedeño-Noda, Juan José Espino-Martín:
On the K best integer network flows. 616-626 - Xingye Dong, Ping Chen, Houkuan Huang, Maciek Nowak:
A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time. 627-632 - Liangjun Ke, Zuren Feng:
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. 633-638 - Zeynep Uruk, Hakan Gultekin, M. Selim Akturk:
Two-machine flowshop scheduling with flexible operations and controllable processing times. 639-653
Volume 40, Number 3, March 2013
- Mark Wallace, Natashia Boland, Edmund K. Burke:
Transport scheduling: Meeting the challenges of scale, complexity and uncertainty. 655-656 - Jin-Hwa Song, Kevin C. Furman:
A maritime inventory routing problem: Practical approach. 657-665 - Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau:
A heuristic to solve the synchronized log-truck scheduling problem. 666-673 - Faith Jordan Srour, Steef L. van de Velde:
Are Stacker Crane Problems easy? A statistical study. 674-690 - Alan L. Erera, Michael Hewitt, Martin W. P. Savelsbergh, Yang Zhang:
Creating schedules and computing operating costs for LTL load plans. 691-702 - Amie R. Albrecht, David M. Panton, D. H. Lee:
Rescheduling rail networks with maintenance disruptions using Problem Space Search. 703-712 - Richard Lusby, Jesper Larsen, Matthias Ehrgott, David M. Ryan:
A set packing inspired method for real-time junction train routing. 713-724 - Máximo Almodóvar, Ricardo García-Ródenas:
On-line reschedule optimization for passenger railways in case of emergencies. 725-736 - Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo:
A geometric model for an effective rescheduling after reducing service in public transportation systems. 737-746 - Guido Diepen, Barbara F. I. Pieters, J. M. van den Akker, J. A. Hoogeveen:
Robust planning of airport platform buses. 747-757 - Ander García, Pieter Vansteenwegen, Olatz Arbelaitz, Wouter Souffriau, María Teresa Linaza:
Integrating public transportation in personalised electronic tourist guides. 758-774 - Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer:
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. 775-792 - Kerem Akartunali, Natashia Boland, Ian Evans, Mark Wallace, Hamish Waterer:
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. 793-804 - Mohammed Saddoune, Guy Desaulniers, François Soumis:
Aircrew pairings with possible repetitions of the same flight number. 805-814 - Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül, Güvenç Sahin, Hüsnü Yenigün, Duygu Tas, Dilek Tüzün:
Solving a robust airline crew pairing problem with column generation. 815-830 - Hai Jiang, Cynthia Barnhart:
Robust airline schedule design in a dynamic scheduling environment. 831-840 - Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov:
Efficient approximation algorithms for the routing open shop problem. 841-847
- Jau-Chuan Ke, Ying-Lin Hsu, Tzu-Hsin Liu, Zhe George Zhang:
Computational analysis of machine repair problem with unreliable multi-repairmen. 848-855 - Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
The robust vehicle routing problem with time windows. 856-866 - Ulrich Derigs, Markus Pullmann, Ulrich Vogel:
A short note on applying a simple LS/LNS-based metaheuristic to the rollon-rolloff vehicle routing problem. 867-872 - Andreas Bortfeldt, Jörg Homberger:
Packing first, routing second - a heuristic for the vehicle routing and loading problem. 873-885 - Alessandro Condotta, Sigrid Knust, Dimitri Meier, Natalia V. Shakhlevich:
Tabu search and lower bounds for a combined production-transportation problem. 886-900
Volume 40, Number 4, April 2013
- Qingwei Li, Bo Zeng, Alex Savachkin:
Reliable facility location design under disruptions. 901-909 - Claudio Fabiano Motta Toledo, Renato Resende Ribeiro de Oliveira, Paulo Morelato França:
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. 910-919 - Temel Öncan, Ruonan Zhang, Abraham P. Punnen:
The minimum cost perfect matching problem with conflict pair constraints. 920-930 - Jan Verwaeren, Karolien Scheerlinck, Bernard De Baets:
Countering the negative search bias of ant colony optimization in subset selection problems. 931-942 - Lukas Bach, Geir Hasle, Sanne Wøhlk:
A lower bound for the Node, Edge, and Arc Routing Problem. 943-952 - Sebastian Sterzik, Herbert Kopfer:
A Tabu Search Heuristic for the Inland Container Transportation Problem. 953-962 - Ali Mohammad Nezhad, Roohollah Aliakbari Shandiz, Abdolhamid Eshraghniaye Jahromi:
A particle swarm-BFGS algorithm for nonlinear programming problems. 963-972 - Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey:
The Anonymous Subgraph Problem. 973-979 - Mohammad Mahdi Paydar, Mohammad Saidi-Mehrabad:
A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy. 980-990 - Jefferson L. M. da Silveira, Flávio Keidi Miyazawa, Eduardo C. Xavier:
Heuristics for the strip packing problem with unloading constraints. 991-1003 - Tomislav Rudec, Robert Manger:
A new approach to solve the k-server problem based on network flows and flow cost reduction. 1004-1013 - Haixiang Yao, Zhongfei Li, Yongzeng Lai:
Mean-CVaR portfolio selection: A nonparametric estimation framework. 1014-1022 - Jeroen Beliën, Erik Demeulemeester, Philippe De Bruecker, Jorne Van den Bergh, Brecht Cardoen:
Integrated staffing and scheduling for an aircraft line maintenance problem. 1023-1033 - Amir H. Abdekhodaee, Andrew Wirth:
Off-line scheduling with forbidden zones. 1034-1037 - Zvi Drezner, Alfonsas Misevicius:
Enhancing the performance of hybrid genetic algorithms by differential improvement. 1038-1046 - Benjamin Dussault, Bruce L. Golden, Chris Groër, Edward A. Wasil:
Plowing with precedence: A variant of the windy postman problem. 1047-1059 - Christian Artigues, Peter Brucker, Sigrid Knust, Oumar Koné, Pierre Lopez, Marcel Mongeau:
A note on "event-based MILP models for resource-constrained project scheduling problems". 1060-1063 - Shijin Wang, Ming Liu:
A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. 1064-1075 - Huiyuan Fan, Prashant K. Tarun, Victoria C. P. Chen:
Adaptive value function approximation for continuous-state stochastic dynamic programming. 1076-1084 - Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha:
The Pickup and Delivery Problem with Cross-Docking. 1085-1093 - Yaodong Cui, Liu Yang, Qiulian Chen:
Heuristic for the rectangular strip packing problem with rotation of items. 1094-1099 - Mehdi Iranpoor, S. M. T. Fatemi Ghomi, Mostafa Zandieh:
Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times. 1100-1108 - Adrien Bellanger, Saïd Hanafi, Christophe Wilbaut:
Three-stage hybrid-flowshop model for cross-docking. 1109-1121 - Jong-Geun Kim, Michael J. Kuby:
A network transformation heuristic approach for the deviation flow refueling location model. 1122-1131 - Raf Jans, Jacques Desrosiers:
Efficient symmetry breaking formulations for the job grouping problem. 1132-1142 - Hossein Badri, Mahdi Bashiri, Taha Hossein Hejazi:
Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method. 1143-1154
Volume 40, Number 5, May 2013
- Miguel A. Hinojosa, A. D. López-Sánchez, Alfredo García Hernández-Díaz, Luis V. Santana-Quintero:
Compromise utilitarian solutions in multi-criteria optimization problems as a guide for evolutionary algorithms. 1155-1164 - Said Dabia, El-Ghazali Talbi, Tom Van Woensel, Ton de Kok:
Approximating multi-objective scheduling problems. 1165-1175 - Zhen Yang, Guoqing Wang, Feng Chu:
An effective GRASP and tabu search for the 0-1 quadratic knapsack problem. 1176-1185 - Shih-Wei Lin, Kuo-Ching Ying, Chien-Yi Huang:
Multiprocessor task scheduling in multistage hybrid flowshops: A hybrid artificial bee colony algorithm with bi-directional planning. 1186-1195 - Wanliang Wang, Haiyan Wang, Yanwei Zhao, Li-Ping Zhang, Xinli Xu:
Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm. 1196-1206 - Dongni Li, Yan Wang, Guangxue Xiao, Jiafu Tang:
Dynamic parts scheduling in multiple job shop cells considering intercell moves and flexible routes. 1207-1223 - Stéphane Dauzère-Pérès, Lars Mönch:
Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective. 1224-1233 - Hadi Mokhtari, Isa Nakhai Kamal Abadi:
Scheduling with an outsourcing option on both manufacturer and subcontractors. 1234-1242 - Hakim Akeb, Mhand Hifi:
Solving the circular open dimension problem by using separate beams and look-ahead strategies. 1243-1255