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 - Wanli Xiang, Mei-qing An:
An efficient and robust artificial bee colony algorithm for numerical optimization. 1256-1265 - Kamer Kaya, Johannes Langguth, Fredrik Manne, Bora Uçar:
Push-relabel based algorithms for the maximum transversal problem. 1266-1275 - Claudia O. López, John E. Beasley:
Packing unequal circles using formulation space search. 1276-1288 - Pablo Romero, Franco Robledo Amoza, Pablo Rodríguez-Bocca:
Optimum piece selection strategies for a peer-to-peer video streaming platform. 1289-1299 - Seonjeong Lee, Dongyung Kim, Dongwoo Sheen:
An exact method to find a circle passing through two points and minimizing the maximal weighted distance to a set of points. 1300-1305 - Claudia Archetti, Gianfranco Guastaroba, Maria Grazia Speranza:
Reoptimizing the rural postman problem. 1306-1313 - Abbas Ebadi, Ghasem Moslehi:
An optimal method for the preemptive job shop scheduling problem. 1314-1327 - Yuanguang Zhong, Yong-Wu Zhou, M. I. M. Wahab:
How to make the replenishment and payment strategy under flexible two-part trade credit. 1328-1338 - Steven A. Gabriel, Antonio J. Conejo, Carlos Ruiz, Sauleh Siddiqui:
Solving discretely constrained, mixed linear complementarity problems with applications in energy. 1339-1350 - Fan Wang, Shaorui Zhou, Ning Shi:
Group-to-group reviewer assignment problem. 1351-1362 - Marc Goerigk, Anita Schöbel:
Improving the modulo simplex algorithm for large-scale periodic timetabling. 1363-1370 - Jiarui Fang, Lei Zhao, Jan C. Fransoo, Tom Van Woensel:
Sourcing strategies in supply risk management: An approximate dynamic programming approach. 1371-1382 - Juliane Müller, Christine A. Shoemaker, Robert Piché:
SO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems. 1383-1400 - Xiangjing Lai, Zhipeng Lü:
Multistart Iterated Tabu Search for Bandwidth Coloring Problem. 1401-1409 - Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
A branch-and-price guided search approach to maritime inventory routing. 1410-1419 - M. H. Fazel Zarandi, Hadi Mosadegh, Mohammad Fattahi:
Two-machine robotic cell scheduling problem with sequence-dependent setup times. 1420-1434 - Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende:
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps. 1435-1447 - Víctor Blanco, Safae El-Haj Ben-Ali, Justo Puerto:
Minimizing ordered weighted averaging of rational functions with applications to continuous location. 1448-1460 - Eun-Seok Kim, Daniel Oron:
Multi-location production and delivery with job selection. 1461-1466 - Mohsen Golalikhani, Mark H. Karwan:
A hierarchical procedure for multi-skilled sales force spatial planning. 1467-1480 - Aiying Rong, Kathrin Klamroth, José Rui Figueira:
Multicriteria 0-1 knapsack problems with k-min objectives. 1481-1496 - Dieter Claeys, Bart Steyaert, Joris Walraevens, Koenraad Laevens, Herwig Bruneel:
Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism. 1497-1505 - Wei-xin Cheng, Chong-Chao Huang, Jin-Bao Jian:
An improved infeasible SSLE method for constrained optimization without strict complementarity. 1506-1515 - Fabien Tricoire, Martin Romauch, Karl F. Doerner, Richard F. Hartl:
Addendum to "Heuristics for the multi-period orienteering problem with multiple time windows". 1516-1519
Volume 40, Number 6, June 2013
- José Rui Figueira, El-Ghazali Talbi:
Emergent nature inspired algorithms for multi-objective optimization. 1521-1523 - Antonio Miguel Mora, Juan Julián Merelo Guervós, Pedro A. Castillo, Maribel García Arenas:
hCHAC: A family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem. 1524-1551 - Bernabé Dorronsoro, Grégoire Danoy, Antonio J. Nebro, Pascal Bouvry:
Achieving super-linear performance in parallel multi-objective evolutionary algorithms by means of cooperative coevolution. 1552-1563 - Javid Taheri, Young Choon Lee, Albert Y. Zomaya, Howard Jay Siegel:
A Bee Colony based optimization approach for simultaneous job scheduling and data replication in grid environments. 1564-1578 - Qingfang Ruan, Zhengqian Zhang, Lixin Miao, Haitao Shen:
A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. 1579-1589 - Qiuzhen Lin, Jianyong Chen:
A novel micro-population immune multiobjective optimization algorithm. 1590-1601 - Eunice Oliveira, Carlos Henggeler Antunes, Álvaro Gomes:
A comparative study of different approaches using an outranking relation in a multi-objective evolutionary algorithm. 1602-1615 - Xin-She Yang, Suash Deb:
Multiobjective cuckoo search for design optimization. 1616-1624 - Shih-Wei Lin, Kuo-Ching Ying:
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm. 1625-1647 - Yan-Yan Tan, Yong-Chang Jiao, Hong Li, Xin-Kuan Wang:
MOEA/D + uniform design: A new version of MOEA/D for optimization problems with many objectives. 1648-1660
Volume 40, Number 7, July 2013
- Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. 1661-1670 - Kagan Gokbayrak, E. Alper Yildirim:
Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks. 1671-1679 - Li Tao, Liyuan Zhang, Xuanhua Xu, Shan Gao:
The GI/Geo/1 queue with Bernoulli-schedule-controlled vacation and vacation interruption. 1680-1692 - Mohamed Haouari, Mohamed Kharbeche:
An assignment-based lower bound for a class of two-machine flow shop problems. 1693-1699 - Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits C. R. Spieksma, Pieter Vansteenwegen:
Heuristics for the traveling repairman problem with profits. 1700-1707 - M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
The synchronized arc and node routing problem: Application to road marking. 1708-1715 - Marco Castro, Kenneth Sörensen, Pieter Vansteenwegen, Peter Goos:
A memetic algorithm for the travelling salesperson problem with hotel selection. 1716-1728 - Mehmet Fatih Tasgetiren, Quan-Ke Pan, Ponnuthurai N. Suganthan, Ozge Buyukdagli:
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem. 1729-1743 - Rasool Tahmasbi, Ebrahim Nasrabadi, S. Mehdi Hashemi:
The value of information in stochastic maximum flow problems. 1744-1751 - Xuewen Mu, Yaling Zhang:
An alternating direction method for second-order conic programming. 1752-1757 - Jian Zhang, Wensheng Yang, Yiliu Tu:
Scheduling with compressible and stochastic release dates. 1758-1765 - Mohamed Barkaoui, Michel Gendreau:
An adaptive evolutionary approach for real-time vehicle routing and dispatching. 1766-1776 - Kumar Satyam, Ananth Krishnamurthy, Manjunath Kamath:
Solving general multi-class closed queuing networks using parametric decomposition. 1777-1789 - Sergey A. Dudin, Che Soong Kim, Olga S. Dudina:
MMAP|M|N queueing system with impatient heterogeneous customers as a model of a contact center. 1790-1803 - Gonçalo Figueira, Maristela Oliveira Santos, Bernardo Almada-Lobo:
A hybrid VNS approach for the short-term production planning and scheduling: A case study in the pulp and paper industry. 1804-1818 - Mariona Vilà, Jordi Pereira:
Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties. 1819-1828 - Francisco J. Rodríguez, Manuel Lozano, Christian Blum, Carlos García-Martínez:
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem. 1829-1841 - Barry R. Cobb, Rafael Rumí, Antonio Salmerón:
Inventory management with log-normal demand per unit time. 1842-1851 - Tao Wu, Canrong Zhang, Zhe Liang, Stephen C. H. Leung:
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. 1852-1863 - Christian Metzger, Frédéric Thiesse, Stanley B. Gershwin, Elgar Fleisch:
The impact of false-negative reads on the performance of RFID-based shelf inventory control policies. 1864-1873 - Ghasem Moslehi, Danial Khorasanian:
Optimizing blocking flow shop scheduling problem with total completion time criterion. 1874-1883 - Guohua Wu, Jin Liu, Manhao Ma, Dishan Qiu:
A two-phase scheduling method with the consideration of task clustering for earth observing satellites. 1884-1894 - Nathalie Perrier, Bruno Agard, Pierre Baptiste, Jean-Marc Frayret, André Langevin, Robert Pellerin, Diane Riopel, Martin Trépanier:
A survey of models and algorithms for emergency response logistics in electric distribution systems. Part I: Reliability planning with fault considerations. 1895-1906 - Nathalie Perrier, Bruno Agard, Pierre Baptiste, Jean-Marc Frayret, André Langevin, Robert Pellerin, Diane Riopel, Martin Trépanier:
A survey of models and algorithms for emergency response logistics in electric distribution systems. Part II: Contingency planning level. 1907-1922
Volume 40, Number 8, August 2013
- Na Li, Zhibin Jiang:
Modeling and optimization of a product-service system with additional service capacity and impatient customers. 1923-1937 - Laurent Alfandari, J. Sadki, Agnès Plateau, Anass Nagih:
Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning. 1938-1946 - Juyoung Wy, Byung-In Kim:
A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem. 1947-1952 - Fabio Furini, Enrico Malaguti:
Models for the two-dimensional two-stage cutting stock problem with multiple stock size. 1953-1962 - Chih-Chiang Lin, Pi-Chung Wang:
A rock-paper-scissors evolutionary algorithm for the TDMA broadcast scheduling problem. 1963-1971 - Joe Naoum-Sawaya, Samir Elhedhli:
A stochastic optimization model for real-time ambulance redeployment. 1972-1978 - Selçuk Gören, Henri Pierreval:
Taking advantage of a diverse set of efficient production schedules: A two-step approach for scheduling with side concerns. 1979-1990 - Mohammad Reza Pasandideh, Marc St-Hilaire:
Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic. 1991-2003 - Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
Lifted and Local Reachability Cuts for the Vehicle Routing Problem with Time Windows. 2004-2010 - Ting Zhang, George Q. Huang, Ting Qu, Zhi Li:
Headquarter-centered common sourcing management through order coordination and consolidation. 2011-2025 - Pedro Augusto Munari, Jacek Gondzio:
Using the primal-dual interior point algorithm within the branch-price-and-cut method. 2026-2036 - Qiong Jia, Yoonho Seo:
Solving resource-constrained project scheduling problems: Conceptual validation of FLP formulation and efficient permutation-based ABC computation. 2037-2050 - Alex J. Ruiz-Torres, Giuseppe Paletta, Eduardo Pérez-Roman:
Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects. 2051-2061 - Vladimir L. Beresnev:
Branch-and-bound algorithm for a competitive facility location problem. 2062-2070 - Agnieszka Rudek, Radoslaw Rudek:
Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms. 2071-2082 - Su Nguyen, Mengjie Zhang, Mark Johnston, Kay Chen Tan:
Hybrid evolutionary computation methods for quay crane scheduling problems. 2083-2093 - Hanan Mahmoud, John W. Chinneck:
Achieving MILP feasibility quickly using general disjunctions. 2094-2102 - María Batista-Galván, Jorge Riera-Ledesma, Juan José Salazar González:
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach. 2103-2115 - Wen-Hsiang Wu, Jianyou Xu, Wen-Hung Wu, Yunqiang Yin, I-Fan Cheng, Chin-Chia Wu:
A tabu method for a two-agent single-machine scheduling with deterioration jobs. 2116-2127 - Chung-Cheng Jason Lu, Jiuh-Biing Sheu:
Robust vertex p-center model for locating urgent relief distribution centers. 2128-2137 - Moncer Hariga, Mehmet Gümüs, A. Daghfous, Suresh K. Goyal:
A vendor managed inventory model under contractual storage agreement. 2138-2144 - Rafael Martinelli, Marcus Poggi, Anand Subramanian:
Improved bounds for large scale capacitated arc routing problem. 2145-2160 - Baruch Mor, Gur Mosheiov, Dvir Shabtay:
A note: Minmax due-date assignment problem with lead-time cost. 2161-2164
Volume 40, Number 9, September 2013
- Roberto Aringhieri, Elena Tanfani, Angela Testi:
Operations research for health care delivery. 2165-2166 - Dionne M. Aleman, Velibor V. Misic, Michael B. Sharpe:
Computational enhancements to fluence map optimization for total marrow irradiation using IMRT. 2167-2177 - Z. Caner Taskin, Mucahit Cevik:
Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures. 2178-2186 - Dimitris Bertsimas, Valentina Cacchiani, David Craft, Omid Nohadani:
A hybrid approach to beam angle optimization in intensity-modulated radiation therapy. 2187-2197 - Guoxuan Ma, Erik Demeulemeester:
A multilevel integrative approach to hospital case mix and capacity planning. 2198-2207 - Leonid Churilov, Audur Fridriksdottir, Mahsa Keshtkaran, Ian Mosley, Andrew M. Flitman, Helen M. Dewey:
Decision support in pre-hospital stroke care operations: A case of using simulation to improve eligibility of acute stroke patients for thrombolysis treatment. 2208-2218 - Mariagrazia Mecoli, Vanda De Angelis, Sally C. Brailsford:
Using system dynamics to evaluate control strategies for mosquito-borne diseases spread by human travel. 2219-2228 - Nedialko B. Dimitrov, Alexander Moffett, David P. Morton, Sahotra Sarkar:
Selecting malaria interventions: A top-down approach. 2229-2240 - Panagiotis Mitropoulos, Ioannis Mitropoulos, Ioannis Giannikos:
Combining DEA with location analysis for the effective consolidation of services in the health sector. 2241-2250
Volume 40, Number 10, October 2013
- Michael Siebert, Marc Goerigk:
An experimental comparison of periodic timetabling models. 2251-2259 - Thibaut Lust, Antoine Rolland:
Choquet optimal set in biobjective combinatorial optimization. 2260-2269 - Eunice Adjarath Lemamou, Steven Chamberland, Philippe Galinier:
A reliable model for global planning of mobile networks. 2270-2282 - Hatem Hadda:
A note on "A heuristic method for two-stage hybrid flow shop with dedicated machines". 2283 - Andrea Abrardo, Marco Belleschi, Paolo Detti:
Optimal radio resources and transmission formats assignment in OFDMA systems. 2284-2300 - Peiping Shen, Weimin Li, Xiaodi Bai:
Maximizing for the sum of ratios of two convex functions over a convex set. 2301-2307 - Justo Puerto, Federico Perea:
Finding the nucleolus of any n-person cooperative game by a single linear program. 2308-2313 - Alberto García-Villoria, Rafael Pastor:
Minimising maximum response time. 2314-2321 - Ahmad Al Badawi, Ali M. Shatnawi:
Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization. 2322-2328 - James T. Lin, Cheng-Hung Wu, Chih-Wei Huang:
Dynamic vehicle allocation control for automated material handling system in semiconductor manufacturing. 2329-2339 - Wilbert E. Wilhelm, Xue Han, Chaehwa Lee:
Computational comparison of two formulations for dynamic supply chain reconfiguration with capacity expansion and contraction. 2340-2356 - Shahin Gelareh, Rahimeh Neamatian Monemi, Philippe Mahey, Nelson Maculan, David Pisinger:
Single string planning problem arising in liner shipping industries: A heuristic approach. 2357-2373 - Minqiang Li, Haiyang Feng, Fuzan Chen, Jisong Kou:
Optimal versioning strategy for information products with behavior-based utility function of heterogeneous customers. 2374-2386 - Ioannis T. Christou, Spyridon Vassilaras:
A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem. 2387-2397 - Ali Osman Kusakci, Mehmet Can:
An adaptive penalty based covariance matrix adaptation-evolution strategy. 2398-2417 - Carlo Filippi, Elisa Stevanato:
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits. 2418-2428 - Elnaz Miandoabchi, Farzaneh Daneshzand, Wai Yuen Szeto, Reza Zanjirani Farahani:
Multi-objective discrete urban road network design. 2429-2449 - Tanguy Lapègue, Odile Bellenguez-Morineau, Damien Prot:
A constraint-based approach for the shift design personnel task scheduling problem with equity. 2450-2465 - Valentina Cacchiani, Alberto Caprara, Roberto Roberti, Paolo Toth:
A new lower bound for curriculum-based course timetabling. 2466-2477 - Diego Recalde, Ramiro Torres, Polo Vaca:
Scheduling the professional Ecuadorian football league by integer programming. 2478-2484 - Mohamed Haouari, Nelson Maculan, Mehdi Mrad:
Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles. 2485-2492 - Ali Saboury, Nader Ghaffari-Nasab, Farnaz Barzinpour, Mohamad Saeed Jabalameli:
Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks. 2493-2507 - Yannick Kergosien, Christophe Lenté, Jean-Charles Billaut, Sandrine Perrin:
Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex. 2508-2518 - Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi:
A hybrid algorithm for a class of vehicle routing problems. 2519-2531 - Jochen Gönsch, Sebastian Koch, Claudius Steinhardt:
An EMSR-based approach for revenue management with integrated upgrade decisions. 2532-2542 - Atabak Elmi, Seyda Topaloglu:
A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots. 2543-2555 - Leyla Demir, Semra Tunali, Deniz Türsel Eliiyi, Arne Løkketangen:
Two approaches for solving the buffer allocation problem in unreliable production lines. 2556-2563 - Michael Schneider, Bastian Sand, Andreas Stenger:
A note on the time travel approach for handling time windows in vehicle routing problems. 2564-2568 - Benjamin J. Lobo, Thom J. Hodgson, Russell E. King, Kristin A. Thoney, James R. Wilson:
Allocating job-shop manpower to minimize LMAX: Optimality criteria, search heuristics, and probabilistic quality metrics. 2569-2584 - Tzu-Yi Yu, Hsiao-Tzu Huang:
Coupling a memetic algorithm to simulation models for promising multi-period asset allocations. 2585-2597
Volume 40, Number 11, November 2013
- Yun-Qing Rao, Meng-Chang Wang, Kun-Peng Wang, Tou-Ming Wu:
Scheduling a single vehicle in the just-in-time part supply for a mixed-model assembly line. 2599-2610 - Sami Pyöttiälä, Timo Knuutila, Mika Johnsson, Olli Nevalainen:
Minimizing the assembly cycle time on a revolver gantry machine. 2611-2624 - Michele Monaci, Ulrich Pferschy, Paolo Serafini:
Exact solution of the robust knapsack problem. 2625-2631 - Huizhi Yi, Bhaba R. Sarker:
An operational policy for an integrated inventory system under consignment stock policy with controllable lead time and buyers' space limitation. 2632-2645 - Tsan-Ming Choi:
Optimal apparel supplier selection with forecast updates under carbon emission taxation scheme. 2646-2655 - Jinkui Liu:
Convergence properties of a class of nonlinear conjugate gradient methods. 2656-2661 - Tony Wauters, Jannes Verstichel, Greet Vanden Berghe:
An effective shaking procedure for 2D and 3D strip packing problems. 2662-2669 - Pablo Ezzatti, Martín Pedemonte, Alvaro Martín:
An efficient implementation of the Min-Min heuristic. 2670-2676 - Siqian Shen:
Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption. 2677-2688 - Donatella Granata, Gregory Steeger, Steffen Rebennack:
Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms. 2689-2702 - Ju-Liang Zhang, Jian Chen:
Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts. 2703-2710 - Enrique F. Castillo, Aida Calvino, Santos Sánchez-Cambronero, María Nogal, Ana Rivas:
A percentile system optimization approach with and without path enumeration. 2711-2723 - Emre Çelebi, J. David Fuller:
Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models. 2724-2739 - M. A. Hoque:
A manufacturer-buyer integrated inventory model with stochastic lead times for delivering equal- and/or unequal-sized batches of a lot. 2740-2751 - Jesús Gago-Vargas, María Isabel Hartillo-Hermoso, Justo Puerto, José María Ucha-Enríquez:
Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method. 2752-2759 - Michel Denault, Jean-Guy Simonato, Lars Stentoft:
A simulation-and-regression approach for stochastic dynamic programs with endogenous state variables. 2760-2769 - C. Valero-Franco, Antonio M. Rodríguez-Chía, Inmaculada Espejo:
Accelerating convergence in minisum location problem with ℓpℓp norms. 2770-2785 - Donald P. Warsing Jr., Worawut Wangwatcharakul, Russell E. King:
Computing optimal base-stock levels for an inventory system with imperfect supply. 2786-2800 - George Nenes, Sofia Panagiotidou:
An adaptive Bayesian scheme for joint monitoring of process mean and variance. 2801-2815 - Rui Zhang, Jens Kuhpfahl:
Corrigendum to "A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective" [Computers and Operations Research 38 (2011) 854-867]. 2816
Volume 40, Number 12, December 2013
- Chen-Fu Chen, Muh-Cherng Wu, Keng-Han Lin:
Effect of solution representations on Tabu search in scheduling applications. 2817-2825 - Daqin Wang, Ou Tang, Jiazhen Huo:
A heuristic for rationing inventory in two demand classes with backlog costs and a service constraint. 2826-2835 - Jaehwan Yang:
A two-stage hybrid flow shop with dedicated machines at the first stage. 2836-2843 - José Miguel Gutiérrez, Marcos Colebrook, Beatriz Abdul-Jalbar, Joaquín Sicilia:
Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities. 2844-2851 - Derya Sever, Nico P. Dellaert, Tom Van Woensel, Ton de Kok:
Dynamic shortest path problems: Hybrid routing policies considering network disruptions. 2852-2863 - Yuan Yuan, Hua Xu:
An integrated search heuristic for large-scale flexible job shop scheduling problems. 2864-2877 - Maria Albareda-Sambola, Antonio Alonso-Ayuso, Laureano F. Escudero, Elena Fernández, Celeste Pizarro:
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty. 2878-2892 - Alper Hamzadayi, Seyda Topaloglu, Simge Yelkenci Köse:
Nested simulated annealing approach to periodic routing problem of a retail distribution system. 2893-2905 - Xiao-Yuan Wang, Zhili Zhou, Xi Zhang, Ping Ji, Ji-Bo Wang:
Several flow shop scheduling problems with truncated position-based learning effect. 2906-2929 - André Renato Sales Amaral:
A parallel ordering problem in facilities layout. 2930-2939 - Ariel C. Zeballos, Ralf W. Seifert, Margarita Protopappa-Sieke:
Single product, finite horizon, periodic review inventory model with working capital requirements and short-term debt. 2940-2949 - Unai Aldasoro, Laureano F. Escudero, María Merino, Gloria Pérez:
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. Part II: Parallelization. 2950-2960 - Harish Garg, Monica Rani, S. P. Sharma:
An efficient two phase approach for solving reliability-redundancy allocation problem using artificial bee colony technique. 2961-2969 - Min Ji, Jen-Ya Wang, Wen-Chiung Lee:
Minimizing resource consumption on uniform parallel machines with a bound on makespan. 2970-2974 - Wen Jin, Shuiping Chen, Hai Jiang:
Finding the K shortest paths in a time-schedule network with constraints on arcs. 2975-2982 - Xiaolin Li, Yanli Huang, Qi Tan, Huaping Chen:
Scheduling unrelated parallel batch processing machines with non-identical job sizes. 2983-2990 - Hatice Calik, Barbaros C. Tansel:
Double bound method for solving the p-center location problem. 2991-2999 - Gabriel Gutiérrez-Jarpa, Carlos Obreque, Gilbert Laporte, Vladimir Marianov:
Rapid transit network design for optimal cost and origin-destination demand capture. 3000-3009 - Marc Goerigk, Bob Grün, Philipp Heßler:
Branch and bound algorithms for the bus evacuation problem. 3010-3020 - Eugenio K. Epprecht, Francisco Aparisi, Sandra García-Bustos:
Optimal linear combination of Poisson variables for multivariate statistical process control. 3021-3032 - Paraskevi Th. Zacharia, Andreas C. Nearchou:
A meta-heuristic algorithm for the fuzzy assembly line balancing type-E problem. 3033-3044 - Jinn-Tsong Tsai, Jia-Cen Fang, Jyh-Horng Chou:
Optimized task scheduling and resource allocation on cloud computing environment using improved differential evolution algorithm. 3045-3055 - M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems. 3056-3068 - Samir Sebbah, Ahmed Ghanmi, Abdeslem Boukhtouta:
A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution. 3069-3079
- Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications. 3080 - Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems. 3081-3090 - Rafael Martí, Fernando Sandoya:
GRASP and path relinking for the equitable dispersion problem. 3091-3099 - Yang Wang, Zhipeng Lü, Fred W. Glover, Jin-Kao Hao:
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem. 3100-3107 - Roberto Cordone, Guglielmo Lulli:
A GRASP metaheuristic for microarray data analysis. 3108-3120 - Mariá Cristina Vasconcelos Nascimento, Leonidas S. Pitsoulis:
Community detection by modularity maximization using GRASP with path relinking. 3121-3131 - Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering. 3132-3146 - Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos:
A hybrid column generation with GRASP and path relinking for the network load balancing problem. 3147-3158 - Hugo Barbalho, Isabel Rosseti, Simone L. Martins, Alexandre Plastino:
A hybrid data mining GRASP with path-relinking. 3159-3173 - Oscar Pedrola, Marc Ruiz, Luis Velasco, Davide Careglio, Óscar González de Dios, Jaume Comellas:
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem. 3174-3187 - Renato E. N. Moraes, Celso C. Ribeiro:
Power optimization in ad hoc wireless network topology control with biconnectivity requirements. 3188-3196 - Kenneth Sörensen, Patrick Schittekat:
Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem. 3197-3205 - Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França:
GRASP with evolutionary path-relinking for the capacitated arc routing problem. 3206-3217 - Mário Mestria, Luiz Satoru Ochi, Simone de Lima Martins:
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. 3218-3229
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 2025-10-31 21:54 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:
