Volume 35,
Number 1,
January 2008
Part Special Issue:
Applications of OR in Finance
- Michèle Breton:
Special Issue of Computers & Operations Research Applications of OR in Finance.
1-2
Electronic Edition (link) BibTeX
- Dimitris Bertsimas, Dessislava Pachamanova:
Robust multiperiod portfolio management in the presence of transaction costs.
3-17
Electronic Edition (link) BibTeX
- Michael J. Best, Jaroslava Hlouskova:
Quadratic programming with transaction costs.
18-33
Electronic Edition (link) BibTeX
- Lean Yu, Shouyang Wang, Kin Keung Lai:
Neural network-based mean-variance-skewness model for portfolio selection.
34-46
Electronic Edition (link) BibTeX
- Ricardo Josa-Fombellida, Juan Pablo Rincón-Zapatero:
Funding and investment decisions in a stochastic defined benefit pension plan with several levels of labor-income earnings.
47-63
Electronic Edition (link) BibTeX
- Javier de Frutos:
A spectral method for bonds.
64-75
Electronic Edition (link) BibTeX
- Xun Li, Zhenyu Wu:
On an approximation method for pricing a high-dimensional basket option on assets with mean-reverting prices.
76-89
Electronic Edition (link) BibTeX
- Eymen Errais, Jeffrey Sadowsky:
Valuing pilot projects in a learning by investing framework: An approximate dynamic programming approach.
90-112
Electronic Edition (link) BibTeX
- Gonzalo Cortazar, Miguel Gravet, Jorge Urzua:
The valuation of multidimensional American real options using the LSM simulation method.
113-129
Electronic Edition (link) BibTeX
- Pierre Duchesne, Maria Pacurar:
Evaluating financial time series models for irregularly spaced data: A spectral density approach.
130-155
Electronic Edition (link) BibTeX
- Rosangela Helena Loschi, Frederico R. B. Cruz, Ricardo H. C. Takahashi, Pilar Loreto Iglesias, Reinaldo Boris Arellano-Valle, James MacGregor Smith:
A note on Bayesian identification of change points in data sequences.
156-170
Electronic Edition (link) BibTeX
- Mohamed A. Ayadi, Lawrence Kryzanowski:
Portfolio performance sensitivity for various asset-pricing kernels.
171-185
Electronic Edition (link) BibTeX
Normal Papers
- Maria João Alves, João C. N. Clímaco, Carlos Henggeler Antunes, Humberto Jorge, Antonio Gomes Martins:
Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management.
186-197
Electronic Edition (link) BibTeX
- Sarah Steiner, Tomasz Radzik:
Computing all efficient solutions of the biobjective minimum spanning tree problem.
198-211
Electronic Edition (link) BibTeX
- Yaodong Cui:
Heuristic and exact algorithms for generating homogenous constrained three-staged cutting patterns.
212-225
Electronic Edition (link) BibTeX
- Mercedes Esteban-Bravo, Francisco J. Nogales:
Solving dynamic stochastic economic models by mathematical programming decomposition methods.
226-240
Electronic Edition (link) BibTeX
- M. Caserta, E. Quiñonez Rico, A. Márquez Uribe:
A cross entropy algorithm for the Knapsack problem with setups.
241-252
Electronic Edition (link) BibTeX
- Andrew J. Higgins, Stefan Hajkowicz, Elisabeth N. Bui:
A multi-objective model for environmental investment decision making.
253-266
Electronic Edition (link) BibTeX
- Julia A. Bennell, Xiang Song:
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums.
267-281
Electronic Edition (link) BibTeX
- Chaoyong Zhang, Peigen Li, Yunqing Rao, Zailin Guan:
A very fast TS/SA algorithm for the job shop scheduling problem.
282-294
Electronic Edition (link) BibTeX
- Tarik Belgacem, Mhand Hifi:
Sensitivity analysis of the knapsack sharing problem: Perturbation of the weight of an item.
295-308
Electronic Edition (link) BibTeX
Volume 35,
Number 2,
February 2008
Part Special Issue:
Location Modeling Dedicated to the memory of Charles S. ReVelle
- Horst A. Eiselt, Samuel Ratick:
Introduction.
309-311
Electronic Edition (link) BibTeX
- Barbara Pfeiffer, Kathrin Klamroth:
A unified model for Weber problems with continuous and network distances.
312-326
Electronic Edition (link) BibTeX
- Lixun Zhang, Gerard Rushton:
Optimizing the size and locations of facilities in competitive multi-site service systems.
327-338
Electronic Edition (link) BibTeX
- Alan T. Murray, Morton E. O'Kelly, Richard L. Church:
Regional service coverage modeling.
339-355
Electronic Edition (link) BibTeX
- Oded Berman, Rongbing Huang:
The minimum weighted covering location problem with distance constraints.
356-372
Electronic Edition (link) BibTeX
- Yolanda Hinojosa, Jörg Kalcsics, Stefan Nickel, Justo Puerto, Sebastian Velten:
Dynamic supply chain design with inventory.
373-391
Electronic Edition (link) BibTeX
- Oded Berman, Qian Wang:
Locating a semi-obnoxious facility with expropriation.
392-403
Electronic Edition (link) BibTeX
- Enrique Domínguez, José Muñoz:
A neural model for the p-median problem.
404-416
Electronic Edition (link) BibTeX
- Richard L. Church:
BEAMR: An exact and approximate model for the p-median problem.
417-426
Electronic Edition (link) BibTeX
- Charles S. Revelle, Michelle Scholssberg, Justin Williams:
Solving the maximal covering location problem with heuristic concentration.
427-435
Electronic Edition (link) BibTeX
- Giuseppe Bruno, Gennaro Improta:
Using gravity models for the evaluation of new university site locations: A case study.
436-444
Electronic Edition (link) BibTeX
- Bilal Farhan, Alan T. Murray:
Siting park-and-ride facilities using a multi-objective spatial optimization model.
445-456
Electronic Edition (link) BibTeX
- Ronald K. Klimberg, Samuel J. Ratick:
Modeling data envelopment analysis (DEA) efficient location/allocation decisions.
457-474
Electronic Edition (link) BibTeX
- Vladimir Marianov, Charles S. Revelle, Stephanie Snyder:
Selecting compact habitat reserves for species with differential habitat size needs.
475-487
Electronic Edition (link) BibTeX
- Justin C. Williams:
Optimal reserve site selection with distance requirements.
488-498
Electronic Edition (link) BibTeX
- Rex K. Kincaid, Catherine Easterling, Meagan Jeske:
Computational experiments with heuristics for two nature reserve site selection problems.
499-512
Electronic Edition (link) BibTeX
- Horst A. Eiselt, Vladimir Marianov:
Employee positioning and workload allocation.
513-524
Electronic Edition (link) BibTeX
Normal papers
- Alix Munier Kordon, Djamal Rebaine:
Polynomial time algorithms for the UET permutation flowshop problem with time delays.
525-537
Electronic Edition (link) BibTeX
- Marc Peeters, Leo G. Kroon:
Circulation of railway rolling stock: a branch-and-price approach.
538-556
Electronic Edition (link) BibTeX
- Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari:
Max-min fairness in multi-commodity flows.
557-573
Electronic Edition (link) BibTeX
- Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna, Frank Werner:
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date.
574-599
Electronic Edition (link) BibTeX
- Luis Gouveia, Ana Paias, Dushyant Sharma:
Modeling and solving the rooted distance-constrained minimum spanning tree problem.
600-613
Electronic Edition (link) BibTeX
- Satyaveer Singh Chauhan, Alain Martel, Sophie D'Amours:
Roll assortment optimization in a paper mill: An integer programming approach.
614-627
Electronic Edition (link) BibTeX
- Boris Bontoux, Dominique Feillet:
Ant colony optimization for the traveling purchaser problem.
628-637
Electronic Edition (link) BibTeX
- Adam N. Letchford, Nicholas A. Pearson:
Good triangulations yield good tours.
638-647
Electronic Edition (link) BibTeX
Volume 35,
Number 3,
March 2008
Part Special Issue:
New Trends in Locational Analysis
- S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis.
649-650
Electronic Edition (link) BibTeX
- M. Cruz López-de-los-Mozos, Juan A. Mesa, Justo Puerto:
A generalized model of equality measures in network location problems.
651-660
Electronic Edition (link) BibTeX
- Éric Gourdin, Olivier Klopfenstein:
Multi-period capacitated location with modular equipments.
661-682
Electronic Edition (link) BibTeX
- Frank Plastria, Lieselot Vanhaverbeke:
Discrete models for competitive location with foresight.
683-700
Electronic Edition (link) BibTeX
- T. B. Boffey, Juan A. Mesa, Francisco A. Ortega, J. I. Rodrigues:
Locating a low-level waste disposal site.
701-716
Electronic Edition (link) BibTeX
- Zvi Drezner:
Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem.
717-736
Electronic Edition (link) BibTeX
- Blas Pelegrín, José Fernández, Boglárka Tóth:
The 1-center problem in the plane with independent random weights.
737-749
Electronic Edition (link) BibTeX
- Justo Puerto, Antonio M. Rodríguez-Chía:
Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets.
750-765
Electronic Edition (link) BibTeX
- Stefano Benati:
Categorical data fuzzy clustering: An analysis of local search heuristics.
766-775
Electronic Edition (link) BibTeX
Normal Papers
- Ye Chen, Kevin W. Li, D. Marc Kilgour, Keith W. Hipel:
A case-based distance model for multiple criteria ABC analysis.
776-796
Electronic Edition (link) BibTeX
- José Luis González Velarde, Rafael Martí:
Adaptive memory programing for the robust capacitated international sourcing problem.
797-806
Electronic Edition (link) BibTeX
- Mark Lewis, Gary A. Kochenberger, Bahram Alidaee:
A new modeling and solution approach for the set-partitioning problem.
807-813
Electronic Edition (link) BibTeX
- Hari K. Rajagopalan, Cem Saydam, Jing Xiao:
A multiperiod set covering location model for dynamic redeployment of ambulances.
814-826
Electronic Edition (link) BibTeX
- Imed Kacem, Chengbin Chu, Ahmed Souissi:
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times.
827-844
Electronic Edition (link) BibTeX
- Chinyao Low, Chou-Jung Hsu, Chwen-Tzeng Su:
A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines.
845-853
Electronic Edition (link) BibTeX
- Roberto Cordone, Federico Gandellini, Giovanni Righini:
Solving the swath segment selection problem through Lagrangean relaxation.
854-862
Electronic Edition (link) BibTeX
- Sang-Oh Shim, Yeong-Dae Kim:
A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property.
863-875
Electronic Edition (link) BibTeX
- Dar-Li Yang, Chou-Jung Hsu, Wen-Hung Kuo:
A two-machine flowshop scheduling problem with a separated maintenance constraint.
876-883
Electronic Edition (link) BibTeX
- Yong-Gon Cho, Keun-Tae Cho:
A loss function approach to group preference aggregation in the AHP.
884-892
Electronic Edition (link) BibTeX
- Alexandre Dolgui, Maxim Pashkevich:
On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items.
893-905
Electronic Edition (link) BibTeX
- Philippe Baptiste, Marta Flamini, Francis Sourd:
Lagrangian bounds for just-in-time job-shop scheduling.
906-915
Electronic Edition (link) BibTeX
- Silvio A. de Araujo, Marcos N. Arenales, Alistair R. Clark:
Lot sizing and furnace scheduling in small foundries.
916-932
Electronic Edition (link) BibTeX
- Deniz Türsel Eliiyi, Melih Özlen:
A Lagrangean relaxation approach for the mixed-model flow line sequencing problem.
933-943
Electronic Edition (link) BibTeX
- François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim:
A new constraint programming approach for the orthogonal packing problem.
944-959
Electronic Edition (link) BibTeX
- Ivo Blöchliger, Nicolas Zufferey:
A graph coloring heuristic using partial solutions and a reactive tabu scheme.
960-975
Electronic Edition (link) BibTeX
- Reakook Hwang, Mitsuo Gen, Hiroshi Katayama:
A comparison of multiprocessor task scheduling algorithms with communication costs.
976-993
Electronic Edition (link) BibTeX
- Peter Zörnig:
A note on cycling LP examples with permutation structure.
994-1002
Electronic Edition (link) BibTeX
Volume 35,
Number 4,
April 2008
- E. Jack Chen, W. David Kelton:
Estimating steady-state distributions via simulation-generated histograms.
1003-1016
Electronic Edition (link) BibTeX
- Mahesh Kumar, James B. Orlin:
Scale-invariant clustering with minimum volume ellipsoids.
1017-1029
Electronic Edition (link) BibTeX
- Kuo-Ling Huang, Ching-Jong Liao:
Ant colony optimization combined with taboo search for the job shop scheduling problem.
1030-1046
Electronic Edition (link) BibTeX
- Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Henrique Pacca Loureiro Luna:
Benders decomposition for the uncapacitated multiple allocation hub location problem.
1047-1064
Electronic Edition (link) BibTeX
- Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
Reactive GRASP for the strip-packing problem.
1065-1083
Electronic Edition (link) BibTeX
- Ali Husseinzadeh Kashan, Behrooz Karimi, Masoud Jenabi:
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes.
1084-1098
Electronic Edition (link) BibTeX
- Mohammad Mahdavi Mazdeh, Mansoor Sarhadi, Khalil S. Hindi:
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times.
1099-1111
Electronic Edition (link) BibTeX
- José Brandão, Richard W. Eglese:
A deterministic tabu search algorithm for the capacitated arc routing problem.
1112-1126
Electronic Edition (link) BibTeX
- Emmanuel Néron, Fabrice Tercinet, Francis Sourd:
Search tree based approaches for parallel machine scheduling.
1127-1137
Electronic Edition (link) BibTeX
- Cenk Çaliskan:
A double scaling algorithm for the constrained maximum flow problem.
1138-1150
Electronic Edition (link) BibTeX
- Rubén Ruiz, Funda Sivrikaya-Serifoglu, Thijs Urlings:
Modeling realistic hybrid flexible flowshop scheduling problems.
1151-1175
Electronic Edition (link) BibTeX
- Rabia Nessah, Farouk Yalaoui, Chengbin Chu:
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates.
1176-1190
Electronic Edition (link) BibTeX
- José H. Dulá:
A computational study of DEA with massive data sets.
1191-1203
Electronic Edition (link) BibTeX
- Têkogan D. Hemazro, Brigitte Jaumard, Odile Marcotte:
A column generation and branch-and-cut algorithm for the channel assignment problem.
1204-1226
Electronic Edition (link) BibTeX
- Alex J. Ruiz-Torres, Grisselle Centeno:
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources.
1227-1249
Electronic Edition (link) BibTeX
- Pedro Leite Rocha, Martín Gómez Ravetti, Geraldo Robson Mateus, Panos M. Pardalos:
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times.
1250-1264
Electronic Edition (link) BibTeX
- Grigorios N. Beligiannis, Charalampos N. Moschopoulos, Georgios P. Kaperonis, Spiridon D. Likothanassis:
Applying evolutionary computation to the school timetabling problem: The Greek case.
1265-1280
Electronic Edition (link) BibTeX
- Yaodong Cui, Yuli Yang, Xian Cheng, Peihua Song:
A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem.
1281-1291
Electronic Edition (link) BibTeX
- Patrick N. Bless, Diego Klabjan, Soo Y. Chang:
Heuristics for automated knowledge source integration and service composition.
1292-1314
Electronic Edition (link) BibTeX
- Cláudio Alves, José M. Valério de Carvalho:
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem.
1315-1328
Electronic Edition (link) BibTeX
- Andreas C. Nearchou:
A differential evolution approach for the common due date early/tardy job scheduling problem.
1329-1343
Electronic Edition (link) BibTeX
- Dehua Xu, Kaibiao Sun, Hongxing Li:
Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan.
1344-1349
Electronic Edition (link) BibTeX
- Eva Vallada, Rubén Ruiz, Gerardo Minella:
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics.
1350-1373
Electronic Edition (link) BibTeX
- Bernardo Almada-Lobo, José F. Oliveira, Maria Antónia Carravilla:
A note on "the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times.
1374-1376
Electronic Edition (link) BibTeX
Volume 35,
Number 5,
May 2008
Part Special Issue:
Algorithms and Computational Methods in Feasibility and Infeasibility
- John W. Chinneck:
Editorial.
1377-1378
Electronic Edition (link) BibTeX
- Leon Lasdon, John C. Plummer:
Multistart algorithms for seeking feasibility.
1379-1393
Electronic Edition (link) BibTeX
- Walid Ibrahim, John W. Chinneck:
Improving solver success in reaching feasibility for sets of nonlinear constraints.
1394-1411
Electronic Edition (link) BibTeX
- Chandra Sekhar Pedamallu, Linet Özdamar, Martine Ceberio:
Efficient interval partitioning - Local search collaboration for constraint satisfaction.
1412-1435
Electronic Edition (link) BibTeX
- Matteo Fischetti, Andrea Lodi:
Repairing MIP infeasibility through local branching.
1436-1445
Electronic Edition (link) BibTeX
- Mustafa K. Atlihan, Linus Schrage:
Generalized filtering algorithms for infeasibility analysis.
1446-1464
Electronic Edition (link) BibTeX
- Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale:
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem.
1465-1482
Electronic Edition (link) BibTeX
- Jian Yang:
Infeasibility resolution based on goal programming.
1483-1493
Electronic Edition (link) BibTeX
- Paula Amaral, Joaquim Júdice, Hanif D. Sherali:
A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints.
1494-1509
Electronic Edition (link) BibTeX
- Yu Xia, Farid Alizadeh:
The Q method for second order cone programming.
1510-1538
Electronic Edition (link) BibTeX
Normal papers
- Dvir Shabtay:
Due date assignments and scheduling a single machine with a general earliness/tardiness cost function.
1539-1545
Electronic Edition (link) BibTeX
- Ardavan Asef-Vaziri, Nicholas G. Hall, Ronny George:
The significance of deterministic empty vehicle trips in the design of a unidirectional loop flow path.
1546-1561
Electronic Edition (link) BibTeX
- Marta Mesquita, Ana Paias:
Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem.
1562-1575
Electronic Edition (link) BibTeX
- Robert A. Russell, Wen-Chyuan Chiang, David Zepeda:
Integrating multi-product production and distribution in newspaper logistics.
1576-1588
Electronic Edition (link) BibTeX
- Paolo Dell'Olmo, Antonio Iovanella, Guglielmo Lulli, Benedetto Scoppola:
Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates.
1589-1600
Electronic Edition (link) BibTeX
- Artyom G. Nahapetyan, Panos M. Pardalos:
A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems.
1601-1612
Electronic Edition (link) BibTeX
- M. T. Almeida, G. Schütz, F. D. Carvalho:
Cell suppression problem: A genetic-based approach.
1613-1623
Electronic Edition (link) BibTeX
- Fuh-Hwa Franklin Liu, Hao Hsuan Peng:
Ranking of units on the DEA frontier with common weights.
1624-1637
Electronic Edition (link) BibTeX
- Juan José Salazar González:
Statistical confidentiality: Optimization techniques to protect tables.
1638-1651
Electronic Edition (link) BibTeX
- Chin-Chia Wu, Yau-Ren Shiau, Wen-Chiung Lee:
Single-machine group scheduling problems with deterioration consideration.
1652-1659
Electronic Edition (link) BibTeX
- Byeong Seok Ahn, Kyung Sam Park:
Comparing methods for multiattribute decision making with ordinal weights.
1660-1670
Electronic Edition (link) BibTeX
- X. Q. Cai, J. Chen, Y. B. Xiao, X. L. Xu:
Product selection, machine time allocation, and scheduling decisions for manufacturing perishable products subject to a deadline.
1671-1683
Electronic Edition (link) BibTeX
- Seong-Woo Choi, Yeong-Dae Kim:
Minimizing makespan on an m-machine re-entrant flowshop.
1684-1696
Electronic Edition (link) BibTeX
- Y. A. Rios-Solis, F. Sourd:
Exponential neighborhood search for a parallel machine scheduling problem.
1697-1712
Electronic Edition (link) BibTeX
- Issmail Elhallaoui, Guy Desaulniers, Abdelmoutalib Metrane, François Soumis:
Bi-dynamic constraint aggregation and subproblem reduction.
1713-1724
Electronic Edition (link) BibTeX
- Abdellah El-Fallahi, Christian Prins, Roberto Wolfler Calvo:
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem.
1725-1741
Electronic Edition (link) BibTeX
- Zhipeng Lü, Wenqi Huang:
PERM for solving circle packing problem.
1742-1755
Electronic Edition (link) BibTeX
Volume 35,
Number 6,
June 2008
Part Special Issue:
OR Applications in the Military and in Counter-Terrorism
- Rajan Batta:
Foreword.
1757-1758
Electronic Edition (link) BibTeX
- Orhan Karasakal:
Air defense missile-target allocation models for a naval task group.
1759-1770
Electronic Edition (link) BibTeX
- Corbin G. Koepke, Andrew P. Armacost, Cynthia Barnhart, Stephan E. Kolitz:
An integer programming approach to support the US Air Force's air mobility network.
1771-1788
Electronic Edition (link) BibTeX
- Trevor I. Laine, Kenneth W. Bauer Jr.:
A mathematical framework to optimize ATR systems with non-declarations and sensor fusion.
1789-1812
Electronic Edition (link) BibTeX
- Vijay K. Shetty, Moises Sudit, Rakesh Nagi:
Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles.
1813-1828
Electronic Edition (link) BibTeX
- R. A. Hahn, Alexandra M. Newman:
Scheduling United States Coast Guard helicopter deployment and maintenance at Clearwater Air Station, Florida.
1829-1843
Electronic Edition (link) BibTeX
- John F. Raffensperger, Linus Schrage:
Scheduling training for a tank battalion: How to measure readiness.
1844-1864
Electronic Edition (link) BibTeX
- Richard K. Bullock, Richard F. Deckro, Jeffery D. Weir:
Methodology for competitive strategy development.
1865-1873
Electronic Edition (link) BibTeX
- Jonathan P. Caulkins, Dieter Grass, Gustav Feichtinger, Gernot Tragler:
Optimizing counter-terror operations: Should one fight fire with "fire" or "water"?
1874-1885
Electronic Edition (link) BibTeX
- Yupo Chan, Jean M. Mahan, James W. Chrissis, David A. Drake, Dong Wang:
Hierarchical maximal-coverage location-allocation: Case of generalized search-and-rescue.
1886-1904
Electronic Edition (link) BibTeX
- Maria Paola Scaparra, Richard L. Church:
A bilevel mixed-integer program for critical infrastructure protection planning.
1905-1923
Electronic Edition (link) BibTeX
- Pavel Albores, Duncan Shaw:
Government preparedness: Using simulation to prepare for a terrorist attack.
1924-1943
Electronic Edition (link) BibTeX
- Guillermo Owen, Gordon H. McCormick:
Finding a moving fugitive. A game theoretic representation of search.
1944-1962
Electronic Edition (link) BibTeX
Normal papers
- Victor F. Cavalcante, Cid C. de Souza, Abilio Lucena:
A Relax-and-Cut algorithm for the set partitioning problem.
1963-1981
Electronic Edition (link) BibTeX
- Aníbal Alberto Vilcapoma Ignacio, Virgílio José Martins Ferreira Filho, Roberto Diéguez Galvão:
Lower and upper bounds for a two-level hierarchical location problem in computer networks.
1982-1998
Electronic Edition (link) BibTeX
- Nees Jan van Eck, Michiel C. van Wezel:
Application of reinforcement learning to the game of Othello.
1999-2017
Electronic Edition (link) BibTeX
- Reha Uzsoy, Juan Diego Velásquez:
Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times.
2018-2033
Electronic Edition (link) BibTeX
- Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka:
Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem.
2034-2048
Electronic Edition (link) BibTeX
- Mohammed S. Zahrani, Martin J. Loomes, James A. Malcolm, Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel, Andreas Alexander Albrecht:
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing.
2049-2070
Electronic Edition (link) BibTeX
- Daniel Oron:
Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times.
2071-2078
Electronic Edition (link) BibTeX
- Andreas Klose:
Algorithms for solving the single-sink fixed-charge transportation problem.
2079-2092
Electronic Edition (link) BibTeX
- Tiravat Assavapokee, Matthew J. Realff, Jane C. Ammons, I-Hsuan Hong:
Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization.
2093-2102
Electronic Edition (link) BibTeX
- Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama:
Solving the variable size bin packing problem with discretized formulations.
2103-2113
Electronic Edition (link) BibTeX
- Horacio Hideki Yanasse, Daniel Massaru Katsurayama:
An enumeration scheme to generate constrained exact checkerboard patterns.
2114-2128
Electronic Edition (link) BibTeX
Volume 35,
Number 7,
July 2008
Part Special Issue:
Includes selected papers presented at the ECCO'04 European Conference on combinatorial Optimization
Normal papers
- Francisco Ballestín, Roel Leus:
Meta-heuristics for stable scheduling on a single machine.
2175-2192
Electronic Edition (link) BibTeX
- Geir Dahl, Harald Minken:
Methods based on discrete optimization for finding road network rehabilitation strategies.
2193-2208
Electronic Edition (link) BibTeX
- Natashia Boland, Barry D. Hughes, Liam T. G. Merlot, Peter J. Stuckey:
New integer linear programming approaches for course timetabling.
2209-2233
Electronic Edition (link) BibTeX
- Erhan Erkut, Fatma Gzara:
Solving the hazmat transport network design problem.
2234-2247
Electronic Edition (link) BibTeX
- Siddhartha S. Syam:
A multiple server location-allocation model for service system design.
2248-2265
Electronic Edition (link) BibTeX
- Martin W. P. Savelsbergh, Jin-Hwa Song:
An optimization algorithm for the inventory routing problem with continuous moves.
2266-2282
Electronic Edition (link) BibTeX
- Kok-Hua Loh, Bruce L. Golden, Edward A. Wasil:
Solving the one-dimensional bin packing problem with a weight annealing heuristic.
2283-2291
Electronic Edition (link) BibTeX
- Carlos Gomes da Silva, João C. N. Clímaco, José Rui Figueira:
Core problems in bi-criteria {0, 1}-knapsack problems.
2292-2306
Electronic Edition (link) BibTeX
- Brian Kallehauge:
Formulations and exact algorithms for the vehicle routing problem with time windows.
2307-2330
Electronic Edition (link) BibTeX
- Anthony Caumond, Philippe Lacomme, Nikolay Tchernev:
A memetic algorithm for the job-shop with time-lags.
2331-2356
Electronic Edition (link) BibTeX
- Ernesto G. Birgin, F. N. C. Sobral:
Minimizing the object dimensions in circle and sphere packing problems.
2357-2375
Electronic Edition (link) BibTeX
- Javier Castro, Daniel Gómez, Juan Tejada:
A polynomial rule for the problem of sharing delay costs in PERT networks.
2376-2387
Electronic Edition (link) BibTeX
- Jorge M. S. Valente, Rui A. F. S. Alves:
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups.
2388-2405
Electronic Edition (link) BibTeX
- Philip A. Scarf, Xin Shi:
The importance of a match in a tournament.
2406-2418
Electronic Edition (link) BibTeX
Volume 35,
Number 8,
August 2008
Queues in Practice
- Mouad Ben Mamoun, Jean-Michel Fourneau, Nihal Pekergin:
Analyzing Weighted Round Robin policies with a stochastic comparison approach.
2420-2431
Electronic Edition (link) BibTeX
- Pietro Canonaco, Pasquale Legato, Rina Mary Mazza, Roberto Musmanno:
A queuing network model for the management of berth crane operations.
2432-2446
Electronic Edition (link) BibTeX
- Stijn De Vuyst, Sabine Wittevrongel, Herwig Bruneel:
Place reservation: Delay analysis of a novel scheduling mechanism.
2447-2462
Electronic Edition (link) BibTeX
- Ken'ichi Kawanishi:
QBD approximations of a call center queueing model with general patience distribution.
2463-2481
Electronic Edition (link) BibTeX
- Joke Lambert, Benny Van Houdt, Chris Blondia:
Queues in DOCSIS cable modem networks.
2482-2496
Electronic Edition (link) BibTeX
- P. Lieshout, Michel Mandjes:
Generalized processor sharing: Characterization of the admissible region and selection of optimal weights.
2497-2519
Electronic Edition (link) BibTeX
- Michael Manitz:
Queueing-model based analysis of assembly lines with finite buffers and general service times.
2520-2536
Electronic Edition (link) BibTeX
- Amit Pazgal, Sonja Radas:
Comparison of customer balking and reneging behavior to queueing theory predictions: An experimental study.
2537-2548
Electronic Edition (link) BibTeX
- Marcos Singer, Patricio Donoso:
Assessing an ambulance service with queuing theory.
2549-2560
Electronic Edition (link) BibTeX
- Wei Xiong, Tayfur Altiok:
Queueing analysis of a server node in transaction processing middleware systems.
2561-2578
Electronic Edition (link) BibTeX
- Mustafa Yuzukirmizi, J. MacGregor Smith:
Optimal buffer allocation in finite closed networks with multiple servers.
2579-2598
Electronic Edition (link) BibTeX
Normal papers
- Imen Essafi, Yazid Mati, Stéphane Dauzère-Pérès:
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem.
2599-2616
Electronic Edition (link) BibTeX
- Feng Du, Gerald W. Evans:
A bi-objective reverse logistics network analysis for post-sale service.
2617-2634
Electronic Edition (link) BibTeX
- Gabriella Stecco, Jean-François Cordeau, Elena Moretti:
A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times.
2635-2655
Electronic Edition (link) BibTeX
- Stein-Erik Fleten, Trine Krogh Kristoffersen:
Short-term hydropower production planning by stochastic programming.
2656-2671
Electronic Edition (link) BibTeX
- Min Kong, Peng Tian, Yucheng Kao:
A new ant colony optimization algorithm for the multidimensional Knapsack problem.
2672-2683
Electronic Edition (link) BibTeX
- Ji-Bo Wang, C. T. Ng, T. C. Edwin Cheng:
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint.
2684-2693
Electronic Edition (link) BibTeX
- Raffaele Cerulli, Monica Gentili, A. Iossa:
Efficient preflow push algorithms.
2694-2708
Electronic Edition (link) BibTeX
Volume 35,
Number 9,
September 2008
Part Special Issue:
Bio-inspired Methods in Combinatorial Optimization
- Karl F. Doerner, Richard F. Hartl:
Editorial.
2709-2710
Electronic Edition (link) BibTeX
- Walter J. Gutjahr:
First steps to the runtime complexity analysis of ant colony optimization.
2711-2727
Electronic Edition (link) BibTeX
- James Montgomery, Marcus Randall, Tim Hendtlass:
Solution bias in ant colony optimisation: Lessons for selecting pheromone models.
2728-2749
Electronic Edition (link) BibTeX
- Frank Neumann:
Expected runtimes of evolutionary algorithms for the Eulerian cycle problem.
2750-2759
Electronic Edition (link) BibTeX
- A. I. Ölçer:
A hybrid approach for multi-objective combinatorial optimisation problems in ship design and shipping.
2760-2775
Electronic Edition (link) BibTeX
- Antonio J. Nebro, Gabriel Luque, Francisco Luna, Enrique Alba:
DNA fragment assembly using a grid-based genetic algorithm.
2776-2790
Electronic Edition (link) BibTeX
- Bo Liu, Ling Wang, Yihui Jin:
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers.
2791-2806
Electronic Edition (link) BibTeX
- Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Liang:
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem.
2807-2839
Electronic Edition (link) BibTeX
- Pablo Cortés, José M. García, Jesús Muñuzuri, Luis Onieva:
Viral systems: A new bio-inspired optimisation approach.
2840-2860
Electronic Edition (link) BibTeX
Normal Papers
- A. Dasci, M. Karakul:
Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control.
2861-2876
Electronic Edition (link) BibTeX
- Tsung-Sheng Chang:
Best routes selection in international intermodal networks.
2877-2891
Electronic Edition (link) BibTeX
- Jie Gao, Linyan Sun, Mitsuo Gen:
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems.
2892-2907
Electronic Edition (link) BibTeX
- Irina Gribkovskaia Sr., Gilbert Laporte, Aliaksandr Shyshou:
The single vehicle routing problem with deliveries and selective pickups.
2908-2924
Electronic Edition (link) BibTeX
- Alvaro Gomes, Carlos Henggeler Antunes, Antonio Gomes Martins:
Design of an adaptive mutation operator in an electrical load management case study.
2925-2936
Electronic Edition (link) BibTeX
- Mesut Yavuz, Umut H. Inan, Alpaslan Figlali:
Fair referee assignments for professional football leagues.
2937-2951
Electronic Edition (link) BibTeX
- Ling-Huey Su, Yuan-Yu Lee:
The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time.
2952-2963
Electronic Edition (link) BibTeX
- Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos:
Biclustering in data mining.
2964-2987
Electronic Edition (link) BibTeX
- Peter Schütz, Leen Stougie, Asgeir Tomasgard:
Stochastic facility location with general long-run costs and convex short-run costs.
2988-3000
Electronic Edition (link) BibTeX
- Pawel Jan Kalczynski, Jerzy Kamburowski:
An improved NEH heuristic to minimize makespan in permutation flow shops.
3001-3008
Electronic Edition (link) BibTeX
- Hande Yaman:
Star p-hub median problem with modular arc capacities.
3009-3019
Electronic Edition (link) BibTeX
- Joaquín Bautista, Elena Fernández, Jordi Pereira:
Solving an urban waste collection problem using ants heuristics.
3020-3033
Electronic Edition (link) BibTeX
- Karl F. Doerner, Manfred Gronalt, Richard F. Hartl, Guenter Kiechle, Marc Reimann:
Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows.
3034-3048
Electronic Edition (link) BibTeX
Volume 35,
Number 10,
October 2008
- Walter J. Gutjahr, Mark Harman:
Search-based software engineering.
3049-3051
Electronic Edition (link) BibTeX
- Eugenia Díaz, Javier Tuya, Raquel Blanco, José Javier Dolado:
A tabu search algorithm for structural software testing.
3052-3072
Electronic Edition (link) BibTeX
- Ahilton Barreto, Márcio de Oliveira Barros, Cláudia Maria Lima Werner:
Staffing a software project: A constraint satisfaction and optimization-based approach.
3073-3089
Electronic Edition (link) BibTeX
- Vittorio Cortellessa, Fabrizio Marinelli, Pasqualina Potena:
An optimization framework for "build-or-buy" decisions in software architecture.
3090-3106
Electronic Edition (link) BibTeX
- Moataz A. Ahmed, Irman Hermadi:
GA-based multiple paths test data generator.
3107-3124
Electronic Edition (link) BibTeX
- Concettina Del Grosso, Giuliano Antoniol, Ettore Merlo, Philippe Galinier:
Detecting buffer overflow via automatic test input data generation.
3125-3143
Electronic Edition (link) BibTeX
- Oliver Bühler, Joachim Wegener:
Evolutionary functional testing.
3144-3160
Electronic Edition (link) BibTeX
- Enrique Alba, J. Francisco Chicano:
Observations in using parallel and sequential evolutionary algorithms for automatic software testing.
3161-3183
Electronic Edition (link) BibTeX
- Joseph El Hayek, Aziz Moukrim, Stéphane Nègre:
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem.
3184-3201
Electronic Edition (link) BibTeX
- F. Pezzella, G. Morganti, G. Ciaschetti:
A genetic algorithm for the Flexible Job-shop Scheduling Problem.
3202-3212
Electronic Edition (link) BibTeX
- Johan Oppen, Arne Løkketangen:
A tabu search approach for the livestock collection problem.
3213-3229
Electronic Edition (link) BibTeX
- Ming-Jong Yao, Weng-Ming Chu, Yen-Fei Lin:
Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment schedule.
3230-3242
Electronic Edition (link) BibTeX
- D. Y. Sha, Cheng-Yu Hsu:
A new particle swarm optimization for the open shop scheduling problem.
3243-3261
Electronic Edition (link) BibTeX
- Han Yu Gu:
Computation of approximate alpha-points for large scale single machine scheduling problem.
3262-3275
Electronic Edition (link) BibTeX
- Ching-Fang Liaw:
An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops.
3276-3283
Electronic Edition (link) BibTeX
- Ningxiong Xu, Sally A. McKee, Linda K. Nozick, Ruke Ufomata:
Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem.
3284-3297
Electronic Edition (link) BibTeX
- Victor J. Rayward-Smith, D. Rebaine:
Analysis of heuristics for the UET two-machine flow shop problem with time delays.
3298-3310
Electronic Edition (link) BibTeX
- M. Elena Sáiz, Eligius M. T. Hendrix:
Methods for computing Nash equilibria of a location-quantity game.
3311-3330
Electronic Edition (link) BibTeX
- Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez:
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem.
3331-3346
Electronic Edition (link) BibTeX
- Alan R. McKendall Jr.:
Improved Tabu search heuristics for the dynamic space allocation problem.
3347-3359
Electronic Edition (link) BibTeX
- Patrizia Beraldi, Domenico Conforti, Antonio Violi:
A two-stage stochastic programming model for electric energy producers.
3360-3370
Electronic Edition (link) BibTeX
- Sigrid Lise Nonås, Anders Thorstenson:
Solving a combined cutting-stock and lot-sizing problem with a column generating procedure.
3371-3392
Electronic Edition (link) BibTeX
Volume 35,
Number 11,
November 2008
- Christos D. Tarantilis:
Topics in Real-time Supply Chain Management.
3393-3396
Electronic Edition (link) BibTeX
- Alan Erera, Burak Karacik, Martin W. P. Savelsbergh:
A dynamic driver management scheme for less-than-truckload carriers.
3397-3411
Electronic Edition (link) BibTeX
- Doris Saez, Cristián E. Cortés, Alfredo Núñez:
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering.
3412-3438
Electronic Edition (link) BibTeX
- Shih-Che Lo, Randolph W. Hall:
The design of real-time logistics information system for trucking industry.
3439-3451
Electronic Edition (link) BibTeX
- Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo:
Real-time supply chain control via multi-agent adjustable autonomy.
3452-3464
Electronic Edition (link) BibTeX
- David A. Burke, Kenneth N. Brown, Armagan Tarim, Brahim Hnich:
Learning market prices in real-time supply chain management.
3465-3478
Electronic Edition (link) BibTeX
- Qunhong Tang, George R. Wilson, Eugene Perevalov:
An approximation manpower planning model for after-sales field service support.
3479-3488
Electronic Edition (link) BibTeX
- Abdulrahman Alenezi, Scott A. Moses, Theodore B. Trafalis:
Real-time prediction of order flowtimes using support vector regression.
3489-3503
Electronic Edition (link) BibTeX
- Andrew M. Ross, Ying Rong, Lawrence V. Snyder:
Supply disruptions with time-dependent parameters.
3504-3529
Electronic Edition (link) BibTeX
- Haralambos Sarimveis, Panagiotis Patrinos, Christos D. Tarantilis, Chris T. Kiranoudis:
Dynamic modeling and control of supply chain systems: A review.
3530-3561
Electronic Edition (link) BibTeX
- Yu-Chung Tsao, Gwo-Ji Sheen:
Dynamic pricing, promotion and replenishment policies for a deteriorating item under permissible delay in payments.
3562-3580
Electronic Edition (link) BibTeX
- Frederico R. B. Cruz, A. R. Duarte, Tom Van Woensel:
Buffer allocation in general single-server queueing networks.
3581-3598
Electronic Edition (link) BibTeX
- Luis Gouveia, João Telhada:
The multi-weighted Steiner tree problem: A reformulation by intersection.
3599-3611
Electronic Edition (link) BibTeX
- Chung-Lun Li, Gur Mosheiov, Uri Yovel:
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
3612-3619
Electronic Edition (link) BibTeX
- Christian Blum, Mateu Yábar Vallès, Maria J. Blesa:
An ant colony optimization algorithm for DNA sequencing by hybridization.
3620-3635
Electronic Edition (link) BibTeX
- Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana:
A parallel multistart algorithm for the closest string problem.
3636-3643
Electronic Edition (link) BibTeX
- Patrizia Beraldi, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero:
Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs.
3644-3656
Electronic Edition (link) BibTeX
- Thomas Kelepouris, Panayiotis Miliotis, Katerina Pramatari:
The impact of replenishment parameters and information sharing on the bullwhip effect: A computational study.
3657-3670
Electronic Edition (link) BibTeX
- Maria da Graça Costa, M. Eugénia V. Captivo, João C. N. Clímaco:
Capacitated single allocation hub location problem - A bi-criteria approach.
3671-3695
Electronic Edition (link) BibTeX
- Jorge M. S. Valente, Rui A. F. S. Alves:
Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties.
3696-3713
Electronic Edition (link) BibTeX
- Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen:
An algorithm for ranking assignments using reoptimization.
3714-3726
Electronic Edition (link) BibTeX
- Adam Janiak, Radoslaw Rudek:
A new approach to the learning effect: Beyond the learning curve restrictions.
3727-3736
Electronic Edition (link) BibTeX
Volume 35,
Number 12,
December 2008
- Steven Chamberland:
Editorial.
3737
Electronic Edition (link) BibTeX
- Mohan R. Akella, Rajan Batta, Moises Sudit, Peter A. Rogerson, Alan Blatt:
Cellular network configuration with co-channel and adjacent-channel interference constraints.
3738-3757
Electronic Edition (link) BibTeX
- José Antonio Portilla-Figueras, Sancho Salcedo-Sanz, Alicia Oropesa-García, Carlos Bousoño-Calzón:
Cell size determination in WCDMA systems using an evolutionary programming approach.
3758-3768
Electronic Edition (link) BibTeX
- Yongpei Guan, Weilai Yang, Henry L. Owen, Douglas M. Blough:
A pricing approach for bandwidth allocation in differentiated service networks.
3769-3786
Electronic Edition (link) BibTeX
- Moshe Zukerman, Musa Mammadov, Liansheng Tan, Iradj Ouveysi, Lachlan L. H. Andrew:
To be fair or efficient or a bit of both.
3787-3806
Electronic Edition (link) BibTeX
- Dietmar Tutsch, Günter Hommel:
MLMIN: A multicore processor and parallel computer network topology for multicast.
3807-3821
Electronic Edition (link) BibTeX
- Abderraouf Bahri, Steven Chamberland:
A global approach for designing reliable WDM networks and grooming the traffic.
3822-3833
Electronic Edition (link) BibTeX
- András Faragó:
Efficient blocking probability computation of complex traffic flows for network dimensioning.
3834-3847
Electronic Edition (link) BibTeX
- Katerina Papadaki, Vasilis Friderikos:
Approximate dynamic programming for link scheduling in wireless mesh networks.
3848-3859
Electronic Edition (link) BibTeX
- Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte:
Exact algorithms for the joint object placement and request routing problem in content distribution networks.
3860-3884
Electronic Edition (link) BibTeX
- Katia Jaffrès-Runser, Jean-Marie Gorce, Stéphane Ubéda:
Mono- and multiobjective formulations for the indoor wireless LAN planning problem.
3885-3901
Electronic Edition (link) BibTeX
- M. A. Darwish:
Joint determination of order quantity and reorder point of continuous review model under quantity and freight rate discounts.
3902-3917
Electronic Edition (link) BibTeX
- Ying-Ming Wang, Celik Parkan, Ying Luo:
A linear programming method for generating the most favorable weights from a pairwise comparison matrix.
3918-3930
Electronic Edition (link) BibTeX
- Roberto Montemanni, D. H. Smith, Luca Maria Gambardella:
A heuristic manipulation technique for the sequential ordering problem.
3931-3944
Electronic Edition (link) BibTeX
- Michael Stein, Jürgen Branke, Hartmut Schmeck:
Efficient implementation of an active set algorithm for large-scale portfolio selection.
3945-3961
Electronic Edition (link) BibTeX
- Xingye Dong, Houkuan Huang, Ping Chen:
An improved NEH-based heuristic for the permutation flowshop problem.
3962-3968
Electronic Edition (link) BibTeX
- Faouzi Kamoun:
Performance analysis of a non-preemptive priority queuing system subjected to a correlated Markovian interruption process.
3969-3988
Electronic Edition (link) BibTeX
- Belarmino Adenso-Díaz, Santiago García Carbajal, Surendra M. Gupta:
A path-relinking approach for a bi-criteria disassembly sequencing problem.
3989-3997
Electronic Edition (link) BibTeX
- Stefan Irnich:
Undirected postman problems with zigzagging option: A cutting-plane approach.
3998-4009
Electronic Edition (link) BibTeX
- Dong Liang, Wilbert E. Wilhelm:
Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design.
4010-4026
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:53:49 2009
by Michael Ley (ley@uni-trier.de)
