


default search action
Computers & Operations Research, Volume 39
Volume 39, Number 1, January 2012
- Mhand Hifi, Rym M'Hallah
:
Special issue on knapsack problems and applications. 1-2 - Haibo Wang
, Gary A. Kochenberger, Fred W. Glover:
A computational study on the quadratic knapsack problem with multiple constraints. 3-11 - Lucas Létocart, Anass Nagih
, Gérard Plateau:
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. 12-18 - Raymond R. Hill, Yong Kun Cho, James T. Moore:
Problem reduction heuristic for the 0-1 multidimensional knapsack problem. 19-26 - Federico Della Croce
, Andrea Grosso:
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. 27-31 - Igor Crévits, Saïd Hanafi, Raïd Mansi, Christophe Wilbaut
:
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem. 32-41 - Vincent Boyer
, Didier El Baz
, Moussa Elkihel:
Solving knapsack problems on GPU. 42-47 - Mohammad Dolatabadi, Andrea Lodi, Michele Monaci
:
Exact algorithms for the two-dimensional guillotine knapsack. 48-53 - Ali Khanafer, François Clautiaux, El-Ghazali Talbi:
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts. 54-63 - Stephen C. H. Leung, Defu Zhang, Changle Zhou, Tao Wu
:
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. 64-73 - Leonardo Junqueira
, Reinaldo Morabito
, Denise Sato Yamashita:
Three-dimensional container loading models with cargo stability and load bearing constraints. 74-85 - Victor Claudio Bento de Camargo
, Leandro Mattiolli, Franklina Maria Bragion Toledo:
A knapsack problem as a tool to solve the production planning problem in small foundries. 86-92 - Lauren B. Davis
, Funda Samanlioglu
, Xiaochun Jiang, Daniel Mota
, Paul Stanfield:
A heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP). 93-104 - Bin Zhang:
Capacity-constrained multiple-market price discrimination. 105-111 - Ping-Teng Chang, Jung-Hua Lee:
A fuzzy DEA and knapsack formulation integrated model for project selection. 112-125
Volume 39, Number 2, February 2012
- Anthony Chen
, Zhong Zhou
, Xiangdong Xu:
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem. 127-138 - Douglas José Alem
, Reinaldo Morabito
:
Production planning in furniture settings via robust optimization. 139-150 - Lianxi Hong:
An improved LNS algorithm for real-time vehicle routing problem with time windows. 151-163 - Xiaoyan Zhu, Wilbert E. Wilhelm:
A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation. 164-178 - José Fernando Gonçalves
, Mauricio G. C. Resende:
A parallel multi-population biased random-key genetic algorithm for a container loading problem. 179-190 - Sajid Siraj
, Ludmil Mikhailov
, John A. Keane:
Enumerating all spanning trees for pairwise comparisons. 191-199 - Thiago Alves de Queiroz
, Flávio Keidi Miyazawa
, Yoshiko Wakabayashi
, Eduardo C. Xavier
:
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. 200-212 - Andrea Roli
, Stefano Benedettini, Thomas Stützle
, Christian Blum
:
Large neighbourhood search algorithms for the founder sequence reconstruction problem. 213-224 - M. Hakan Akyüz
, Temel Öncan, I. Kuban Altinel:
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. 225-237 - Sayyed Rasoul Mousavi, Navid Nasr Esfahani:
A GRASP algorithm for the Closest String Problem using a probability-based heuristic. 238-248 - Pablo A. Maya, Kenneth Sörensen
, Peter Goos
:
A metaheuristic for a teaching assistant assignment-routing problem. 249-258 - Athanasios G. Lagodimos, Ioannis T. Christou, Konstantina Skouri
:
Optimal (r, nQ, T) batch ordering with quantized supplies. 259-268 - Niels Hvidberg Kjeldsen, Marco Chiarandini
:
Heuristic solutions to the long-term unit commitment problem with cogeneration plants. 269-282 - Qinghua Wu, Jin-Kao Hao
:
Coloring large graphs based on independent set extraction. 283-290 - Remco Germs, Boris Goldengorin
, Marcel Turkensteen:
Lower tolerance-based Branch and Bound algorithms for the ATSP. 291-298 - Florian Forster, Andreas Bortfeldt:
A tree search procedure for the container relocation problem. 299-309 - Naveen Kumar, Jin-Hwan Borm, Ajay Kumar
:
Reliability analysis of waste clean-up manipulator using genetic algorithms and fuzzy methodology. 310-319 - Tamás Kis
, András Kovács:
A cutting plane approach for integrated planning and scheduling. 320-327 - Po-Chien Tsai, Jia-Yen Huang:
Two-stage replenishment policies for deteriorating items at Taiwanese convenience stores. 328-338 - Yu-Wang Chen
, Yong-Zai Lu, Ming Ge, Genke Yang, Changchun Pan:
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill. 339-349 - Anastasios Xanthopoulos, Dimitrios Vlachos
, Eleftherios Iakovou:
Optimal newsvendor policies for dual-sourcing supply chains: A disruption risk management framework. 350-357 - Ali R. Güner
, Alper Ekrem Murat, Ratna Babu Chinnam
:
Dynamic routing under recurrent and non-recurrent congestion using real-time ITS information. 358-373 - Amina Haned, Ameur Soukhal, Mourad Boudhar
, Nguyen Huynh Tuong:
Scheduling on parallel machines with preemption and transportation delays. 374-381 - Mohamed Bendraouche, Mourad Boudhar
:
Scheduling jobs on identical machines with agreement graph. 382-390 - Jorge Riera-Ledesma
, Juan José Salazar González
:
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. 391-404 - Dvir Shabtay
, Shlomo Karhi:
Online scheduling of two job types on a set of multipurpose machines with unit processing times. 405-412 - Hendrik Baumann, Werner Sandmann:
Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. 413-423 - Birkan Can, Cathal Heavey:
A comparison of genetic programming and artificial neural networks in metamodeling of discrete-event simulation models. 424-436 - Hande Küçükaydin
, Necati Aras
, I. Kuban Altinel:
A leader-follower game in competitive facility location. 437-448 - Ling Wang, Chen Fang:
An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. 449-460 - S. M. H. Manzour-al-Ajdad, S. Ali Torabi
, Saïd Salhi
:
A hierarchical algorithm for the planar single-facility location routing problem. 461-470
Volume 39, Number 3, March 2012
- Rabia Nessah, Imed Kacem
:
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. 471-478 - Thomas Ponsignon
, Lars Mönch:
Heuristic approaches for master planning in semiconductor manufacturing. 479-491 - Ji-Bo Wang, Ming-Zheng Wang:
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. 492-497 - Jochen Gorski, Luís Paquete
, Fábio Pedrosa:
Greedy algorithms for a class of knapsack problems with binary weights. 498-511 - Sayyed Rasoul Mousavi, Farzaneh Tabataba:
An improved algorithm for the longest common subsequence problem. 512-520 - Xiang Li, Gang Du:
Inequality constraint handling in genetic algorithms using a boundary simulation method. 521-540 - Nilay Noyan
:
Risk-averse two-stage stochastic programming with an application to disaster management. 541-559 - Ram Ramakrishnan, Ananth Krishnamurthy:
Performance evaluation of a synchronization station with multiple inputs and population constraints. 560-570 - Baruch Mor
, Gur Mosheiov:
Batch scheduling on uniform machines to minimize total flow-time. 571-575 - Odysseas T. Kosmas, D. S. Vlachos:
Simulated annealing for optimal ship routing. 576-581 - Rui Xu, Huaping Chen, Xueping Li
:
Makespan minimization on single batch-processing machine via ant colony optimization. 582-593 - Pedro Martins
:
Cliques with maximum/minimum edge neighborhood and neighborhood density. 594-608 - Chun-An Chou, Wanpracha Art Chaovalitwongse, Tanya Y. Berger-Wolf
, Bhaskar DasGupta, Mary V. Ashley:
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction. 609-619 - Vladimir Marianov
, Gabriel Gutiérrez-Jarpa
, Carlos Obreque
, Oscar Cornejo:
Lagrangean relaxation heuristics for the p-cable-trench problem. 620-628 - Céline Gicquel, L. Hege, Michel Minoux, W. van Canneyt:
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. 629-636 - Yuma Tanaka, Shinji Imahori, Mihiro Sasaki, Mutsunori Yagiura:
An LP-based heuristic algorithm for the node capacitated in-tree packing problem. 637-646 - Yiyong Xiao
, Ikou Kaku, Qiuhong Zhao, Ren-Qian Zhang:
Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems. 647-658 - Ming-Zheng Wang, Ji-Bo Wang:
Single-machine makespan minimization scheduling with nonlinear shortening processing times. 659-663 - Byungjun You, Takeo Yamada:
Shift-and-merge technique for the DP solution of the time-constrained backpacker problem. 664-670 - Geiza Cristina da Silva
, Laura Bahiense
, Luiz Satoru Ochi
, Paulo Oswaldo Boaventura Netto:
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics. 671-677 - Stephen C. H. Leung, Yangbin Lin, Defu Zhang:
Extended local search algorithm based on nonlinear programming for two-dimensional irregular strip packing problem. 678-686 - Weifeng Gao, San-Yang Liu:
A modified artificial bee colony algorithm. 687-697 - Marie-Laure Bougnol, José H. Dulá, Paul Rouse:
Interior point methods in DEA to determine non-zero multiplier weights. 698-708 - Shunji Tanaka
:
A heuristic algorithm based on Lagrangian relaxation for the closest string problem. 709-717 - Dirk Briskorn
, Andrei Horbach:
A Lagrangian approach for minimum cost single round robin tournaments. 718-727 - Glaydston Mattos Ribeiro
, Gilbert Laporte:
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. 728-735 - Sergiu Carpov
, Jacques Carlier, Dritan Nace, Renaud Sirdey
:
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. 736-745 - Federico Della Croce
, Fabio Salassa
:
Improved LP-based algorithms for the closest string problem. 746-749
Volume 39, Number 4, April 2012
- Desheng Dash Wu
, David L. Olson, John R. Birge
:
Guest editorial. 751-752 - Philipp Aigner, Georg Beyschlag, Tim Friederich, Markus Kalepky, Rudi Zagst:
Modeling and managing portfolios including listed private equity. 753-764 - Sung Ho Ha, Ramayya Krishnan:
Predicting repayment of the credit card debt. 765-773 - Julie J. C. H. Ryan, Thomas A. Mazzuchi, Daniel J. Ryan, Juliana Lopez de la Cruz, Roger M. Cooke
:
Quantifying information security risks using expert judgment elicitation. 774-784 - Ester Gutiérrez
, Sebastián Lozano
:
A competing risks analysis of the duration of federal target funds rates. 785-791 - Santiago Carrillo-Menéndez, Alberto Suárez
:
Robust quantification of the exposure to operational risk: Bringing economic sense to economic capital. 792-804 - Ozden Ustun, Refail Kasimbeyli:
Combined forecasts in portfolio optimization: A generalized approach. 805-819 - Janko Hernández
, David Saunders, Luis A. Seco
:
Algorithmic estimation of risk factors in financial markets with stochastic drift. 820-828 - Chen Chen
, Roy H. Kwon:
Robust portfolio selection for index tracking. 829-837 - João Claro
, Jorge Pinho de Sousa
:
A multiobjective metaheuristic for a mean-risk multistage capacity investment problem with process flexibility. 838-849 - Amanda J. Schmitt, Lawrence V. Snyder:
Infinite-horizon models for inventory control under yield uncertainty and disruptions. 850-862 - Juan Tinguaro Rodríguez
, Begoña Vitoriano
, Javier Montero
:
A general methodology for data-based rule building and its application to natural disaster management. 863-873
Volume 39, Number 5, May 2012
- Kate Smith-Miles
, Leo Lopes:
Measuring instance difficulty for combinatorial optimization problems. 875-889 - Chen Fang, Ling Wang:
An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. 890-901 - Joaquim A. S. Gromicho, Jelke J. van Hoorn
, A. L. Kok, J. M. J. Schutten
:
Restricted dynamic programming: A flexible framework for solving realistic VRPs. 902-909 - A. L. Kok, Erwin W. Hans
, J. M. J. Schutten
:
Vehicle routing under time-dependent travel times: The impact of congestion avoidance. 910-918 - Jeffrey E. Schaller, Jorge M. S. Valente
:
Minimizing the weighted sum of squared tardiness on a single machine. 919-928 - Wenming Zhang, Yinfeng Xu, Feifeng Zheng, Yucheng Dong:
Online algorithms for the multiple time series search problem. 929-938 - Shiqing Yao, Zhibin Jiang, Na Li:
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. 939-951 - Xiao-Bing Hu, Mark S. Leeson
, Evor L. Hines:
An effective genetic algorithm for network coding. 952-963 - Olivia J. Smith
, Natashia Boland
, Hamish Waterer:
Solving shortest path problems with a weight constraint and replenishment arcs. 964-984 - Adam N. Letchford
, Sebastian J. Miller:
Fast bounding procedures for large instances of the Simple Plant Location Problem. 985-990 - Stephen Mahar, Peter A. Salzarulo, P. Daniel Wright:
Using online pickup site inclusion policies to manage demand in retail/E-tail organizations. 991-999 - Peeyush Mehta, Pushkar Pandit, Deepu Philip
, Prabha Sharma:
An efficient local search for minimizing completion time variance in permutation flow shops. 1000-1009 - Rudolf Vetschera
, Adiel Teixeira de Almeida
:
A PROMETHEE-based approach to portfolio selection problems. 1010-1020 - Thomas Volling, Derya Eren Akyol
, Kai Wittek, Thomas Spengler
:
A two-stage bid-price control for make-to-order revenue management. 1021-1032 - Boris Detienne
, Stéphane Dauzère-Pérès
, Claude Yugma:
An exact approach for scheduling jobs with regular step cost functions on a single machine. 1033-1043 - Marco Casazza
, Alberto Ceselli
, Marc Nunkesser:
Efficient algorithms for the double traveling salesman problem with multiple stacks. 1044-1053 - Behnam Behdani, YoungSang Yun, J. Cole Smith
, Ye Xia:
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks. 1054-1061 - Jian-Bo Yang, Dong-Ling Xu
, Shanlin Yang:
Integrated efficiency and trade-off analyses using a DEA-oriented interactive minimax reference point approach. 1062-1073 - Günes Erdogan
, Maria Battarra
, Gilbert Laporte, Daniele Vigo
:
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. 1074-1086 - Dvir Shabtay
, Nufar Gasper:
Two-machine flow-shop scheduling with rejection. 1087-1096 - Vera C. Hemmelmayr
, Verena Schmid, Christian Blum
:
Variable neighbourhood search for the variable sized bin packing problem. 1097-1108 - Yunqiang Yin, Chin-Chia Wu
, Wen-Hsiang Wu, Shuenn-Ren Cheng:
The single-machine total weighted tardiness scheduling problem with position-based learning effects. 1109-1116 - Der-Chiang Li
, Chiao-Wen Liu, Tung-Liang Chen:
Recursive operation time maximization model for the maintenance of power generation equipment. 1117-1121 - Asvin Goel
, Claudia Archetti
, Martin W. P. Savelsbergh
:
Truck driver scheduling in Australia. 1122-1132 - Laureano F. Escudero
, María Araceli Garín, María Merino
, Gloria Pérez
:
An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. 1133-1144 - Xianhui Zeng, Wai-Keung Wong
, Sunney Yung-Sun Leung
:
An operator allocation optimization model for balancing control of the hybrid assembly lines using Pareto utility discrete differential evolution algorithm. 1145-1159 - Zhishuang Yao, Szu Hui Ng, Loo Hay Lee
:
A study on bunker fuel management for the shipping liner services. 1160-1172 - Humberto Heluane
, Aníbal M. Blanco, María Rosa Hernández, J. Alberto Bandoni:
Simultaneous re-design and scheduling of multiple effect evaporator systems. 1173-1186 - Mohamed Haouari
, Anis Kooli, Emmanuel Néron:
Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem. 1187-1194
Volume 39, Number 6, June 2012
- Alexander A. Lazarev, Vincent T'kindt
, Frank Werner
:
Guest Editorial. 1195-1196 - Bahriye Cesaret
, Ceyda Oguz
, F. Sibel Salman
:
A tabu search algorithm for order acceptance and scheduling. 1197-1205 - T. C. Edwin Cheng
, Bertrand M. T. Lin
,