default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 33
Volume 33, Number 1, January 2006
- Paul Corry
, Erhan Kozan:
An assignment model for dynamic load planning of intermodal trains. 1-17 - Ralph Scheubrein, Stanley Zionts:
A problem structuring front end for a multiple criteria decision support system. 18-31 - Art Warburton, Zhe George Zhang:
A simple computational model for analyzing the properties of stop-loss, take-profit, and price breakout trading strategies. 32-42 - Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigues:
Multiple crossdocks with inventory and time windows. 43-63 - Junfang Yu, Bhaba R. Sarker:
A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems. 64-92 - Lauro Cesar Galvão, Antonio Galvão Naclério Novaes, José Eduardo Souza de Cursi, João C. Souza:
A multiplicatively-weighted Voronoi diagram approach to logistics districting. 93-114 - Pavel V. Sevastjanov, Pawel Róg:
Two-objective method for crisp and fuzzy interval comparison in optimization. 115-131 - Xinhui Zhang, Jonathan F. Bard:
Comparative approaches to equipment scheduling in high volume factories. 132-157 - Rasaratnam Logendran, Nasser Salmasi, Chelliah Sriskandarajah:
Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups. 158-180 - M. Teresa Melo, Stefan Nickel, Francisco Saldanha-da-Gama:
Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning. 181-208 - Nathalie Perrier, André Langevin, James F. Campbell:
A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing. 209-238 - Nathalie Perrier, André Langevin, James F. Campbell:
A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal. 239-262 - Geonwook Jeon, Herman R. Leep:
Forming part families by using genetic algorithm and designing machine cells under demand changes. 263-283
Volume 33, Number 2, February 2006
- Georges Zaccour:
Special issue on game theory: Numerical methods and applications. 285 - Eitan Altman, Thomas Boulogne, Rachid El Azouzi, Tania Jiménez, Laura Wynter:
A survey on networking games in telecommunications. 286-311 - Richard Baron, Jacques Durieu, Hans Haller, Philippe Solal:
Complexity and stochastic evolution of dyadic networks. 312-327 - Cheng-Chang Lin, Chun-Hsiung Liao:
The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market. 328-344 - Said Fathy El-Zoghdy, Hisao Kameda, Jie Li:
Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems. 345-355 - Atsushi Inoie, Hisao Kameda, Corinne Touati:
A paradox in optimal flow control of M/M/n queues. 356-368 - Laurent Viguier, Marc Vielle, Alain Haurie, Alain Bernard:
A two-level computable equilibrium model to assess the strategic allocation of emission allowances within the European union. 369-385 - Guiomar Martín-Herrán, Pierre Cartigny, Estelle Motte, Mabel Tidball:
Deforestation and foreign transfers: a Stackelberg differential game approach. 386-400 - Sjur Didrik Flåm:
Balanced environmental games. 401-408 - Andrew R. Leach:
Regulation by reputation. 409-425 - Michèle Breton, Désiré Vencatachellum, Georges Zaccour:
Dynamic R&D with strategic behavior. 426-437 - Giovanni Di Bartolomeo, Jacob Engwerda, Joseph Plasmans, Bas van Aarle:
Staying together or breaking apart: policy-makers' endogenous coalitions formation in the European Economic and Monetary Union. 438-463 - Jakob Laugesen, Erik Mosekilde:
Border-collision bifurcations in a dynamic management game. 464-478 - Joel S. Brown, Thomas L. Vincent:
G-functions for the hermeneutic circle of evolution. 479-499 - Alexander Mehlmann:
Stability and interaction in flatline games. 500-519 - Igor V. Konnov:
Splitting-type method for systems of variational inequalities. 520-534 - Holger Ingmar Meinhardt:
An LP approach to compute the pre-kernel for cooperative games. 535-557
Volume 33, Number 3, March 2006
- Abdullah M. S. Alkahtani, Michael E. Woodward, Khalid Al-Begain:
Prioritised best effort routing with four quality of service metrics applying the concept of the analytic hierarchy process. 559-580 - Hee K. Cho, Chae Y. Lee:
Multicast tree rearrangement to recover node failures in overlay multicast networks. 581-594 - Fermín Alfredo Tang Montané, Roberto Diéguez Galvão:
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. 595-619 - Celia A. Glass, H. R. Mills:
Scheduling unit length jobs with parallel nested machine processing set restrictions. 620-638 - P. V. (Sundar) Balakrishnan, Rakesh Gupta, Varghese S. Jacob:
An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs. 639-659 - Zhongsheng Hua, Bin Zhang, Liang Liang:
An approximate dynamic programming approach to convex quadratic knapsack problems. 660-673 - Chinyao Low, Yukling Yip, Tai-Hsi Wu:
Modelling and heuristics of FMS scheduling with multiple objectives. 674-694 - Ramakrishnan Ramanathan:
ABC inventory classification with multiple-criteria using weighted linear optimization. 695-700 - George F. List, Bryan Wood, Mark A. Turnquist, Linda K. Nozick, Dean A. Jones, Craig R. Lawton:
Logistics planning under uncertainty for disposition of radioactive wastes. 701-723 - Berkin Toktas, Joyce W. Yen, Zelda B. Zabinsky:
Addressing capacity uncertainty in resource-constrained assignment problems. 724-745 - Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska:
Pareto and scalar bicriterion optimization in scheduling deteriorating jobs. 746-767 - Alan R. McKendall Jr., Juan R. Jaramillo:
A tabu search heuristic for the dynamic space allocation problem. 768-789 - Alan R. McKendall Jr., Jin Shang:
Hybrid ant systems for the dynamic facility layout problem. 790-803 - Vitória Pureza, Reinaldo Morabito:
Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem. 804-819 - Sancho Salcedo-Sanz, Yong Xu, Xin Yao:
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems. 820-835 - Hai Yang, Chao Yang, Liping Gan:
Models and algorithms for the screen line-based traffic-counting location problems. 836-858 - Amitava Chatterjee, Patrick Siarry:
Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimization. 859-871 - Hui-Ming Wee, J. F. Jong:
Erratum to "an integrated multi-lot-size production inventory model for deteriorating item" [Computer and Operation Research 30 (2003) 671-682]. 872-873
Volume 33, Number 4, April 2006
Part Special Issue: Optimization Days 2003
- Russell Bent, Pascal Van Hentenryck:
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. 875-893 - Stephan Scheuerer:
A tabu search heuristic for the truck and trailer routing problem. 894-909 - Hatem Ben Amor, Jacques Desrosiers:
A proximal trust-region algorithm for column generation stabilization. 910-927 - Natalia Moreno Palli, Albert Corominas:
Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem. 928-939 - Kap Hwan Kim, Gyu-Pyo Hong:
A heuristic rule for relocating blocks. 940-954 - Philippe Galinier, Brigitte Jaumard:
A Tabu Search algorithm for difference triangle sets and Golomb rulers. 955-970 - Siqun Wang, Monique Guignard:
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems. 971-993
- Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan:
Scheduling two parallel machines with a single server: the general case. 994-1009 - Les R. Foulds, Alan P. French, John M. Wilson:
The sustainable cell formation problem: manufacturing cell creation with machine modification costs. 1010-1032 - Johan Oppen, Arne Løkketangen:
Arc routing in a node routing environment. 1033-1055 - Ali Allahverdi, Fawaz S. Al-Anzi:
A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. 1056-1080 - Antonio Jiménez-Martín, Sixto Ríos-Insua, Alfonso Mateos:
A generic multi-attribute analysis system. 1081-1101 - Kaisa Miettinen, Marko M. Mäkelä, Heikki Maaranen:
Efficient hybrid methods for global continuous optimization based on simulated annealing. 1102-1116 - José Miguel Díaz-Báñez, Ferran Hurtado:
Computing obnoxious 1-corner polygonal chains. 1117-1128 - Jean-Yves Potvin, Ying Xu, Ilham Benyahia:
Vehicle routing and scheduling with dynamic travel times. 1129-1137 - K. Srinivasa Raju, Dasika Nagesh Kumar, Lucien Duckstein:
Artificial neural networks and multicriterion analysis for sustainable irrigation planning. 1138-1153 - Dorabela Gamboa, César Rego, Fred W. Glover:
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem. 1154-1172
Volume 33, Number 5, May 2006
- Manuel Muñiz, Joseph C. Paradi, John Ruggiero, Zijiang Yang:
Evaluating alternative DEA models used to control for non-discretionary inputs. 1173-1183 - Joocheol Kim:
Event tree based sampling. 1184-1199 - Jose M. Framiñan, Christoph J. Schuster:
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. 1200-1213 - Kenneth Sörensen, Marc Sevaux:
MA mid PM: memetic algorithms with population management. 1214-1225 - Ling-Yun Wu, Xiang-Sun Zhang, Ju-Liang Zhang:
Capacitated facility location problem with general setup cost. 1226-1241 - Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama:
On the capacitated concentrator location problem: a reformulation by discretization. 1242-1258 - Md. Mostofa Akbar, Mohammad Sohel Rahman, Mohammad Kaykobad, Eric G. Manning, Gholamali C. Shoja:
Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls. 1259-1273 - Mohamed Haouari, Jouhaina Chaouachi Siala:
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. 1274-1288 - Ramakrishnan Ramanathan:
Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process. 1289-1307 - Sooyoung Kim, Youngshin Park, Chi-Hyuck Jun:
Performance evaluation of re-entrant manufacturing system with production loss using mean value analysis. 1308-1325 - Xiuli Wang, T. C. Edwin Cheng:
A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups. 1326-1344 - Viswanath Kumar Ganesan, Appa Iyer Sivakumar, G. Srinivasan:
Hierarchical minimization of completion time variance and makespan in jobshops. 1345-1367 - Yao Chen, Liang Liang, Feng Yang, Joe Zhu:
Evaluation of information technology investment: a data envelopment analysis approach. 1368-1379 - David Pisinger:
Upper bounds and exact algorithms for p-dispersion problems. 1380-1398 - Hamid Allaoui, Abdelhakim Artiba:
Scheduling two-stage hybrid flow shop with availability constraints. 1399-1419 - F. Aykut Özsoy, Mustafa Ç. Pinar:
An exact algorithm for the capacitated vertex p-center problem. 1420-1436 - M. Montaz Ali:
Global optimization models in data networks: a case study. 1437-1458 - Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott:
The biobjective integer minimum cost flow problem - incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm. 1459-1463 - Brian Kallehauge, Jesper Larsen, Oli B. G. Madsen:
Lagrangian duality applied to the vehicle routing problem with time windows. 1464-1487 - Belmiro P. M. Duarte, Alda Maria dos Santos Reis:
Developing a projects evaluation system based on multiple attribute value theory. 1488-1504
Volume 33, Number 6, June 2006
- Yaodong Cui, Dongli He, Xiaoxia Song:
Generating optimal two-section cutting patterns for rectangular blanks. 1505-1520 - Hamish T. Dean, Yiliu Tu, John F. Raffensperger:
An improved method for calculating the no-fit polygon. 1521-1539 - Julien Fondrevelle, Ammar Oulamara, Marie-Claude Portmann:
Permutation flowshop scheduling problems with maximal and minimal time lags. 1540-1556 - Jaehee Kim, Sheung-Kown Kim:
A CHIM-based interactive Tchebycheff procedure for multiple objective decision making. 1557-1574 - Jan-Kees C. W. van Ommeren, Adriana Felicia Bumb, Andrei Sleptchenko:
Locating repair shops in a stochastic environment. 1575-1594 - Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov, Frank Werner:
Batching work and rework processes with limited deterioration of reworkables. 1595-1605 - Mathieu Beaulieu, Michel Gamache:
An enumeration algorithm for solving the fleet management problem in underground mines. 1606-1624 - Mohamed Ben-Daya, Syed Mobasher Noman, Moncer A. Hariga:
Integrated inventory control and inspection policies with deterministic demand. 1625-1638 - Marcos Negreiros, Augusto Palhano:
The capacitated centred clustering problem. 1639-1663 - Mark W. Lewis, Karen R. Lewis, Barbara Jo White:
Guided design search in the interval-bounded sailor assignment problem. 1664-1680 - Victor Portougal, Dan Trietsch:
Setting due dates in a stochastic single machine environment. 1681-1694 - Walid Abdul-Kader:
Capacity improvement of an unreliable production line - an analytical approach. 1695-1712 - Shyong Jian Shyu, Bertrand M. T. Lin, Tsung-Shen Hsiao:
Ant colony optimization for the cell assignment problem in PCS networks. 1713-1740 - François Cartier, Brunilde Sansò, André Girard:
An efficient heuristic to dimension large-scale hybrid optoelectronic networks. 1741-1759 - Bryan A. Norman, Alice E. Smith:
A continuous approach to considering uncertainty in facility design. 1760-1775 - Beatriz González, Belarmino Adenso-Díaz:
A scatter search approach to the optimum disassembly sequence problem. 1776-1793 - Marc Reimann, Marco Laumanns:
Savings based ant colony optimization for the capacitated minimum spanning tree problem. 1794-1822 - Humberto J. Longo, Marcus Poggi de Aragão, Eduardo Uchoa:
Solving capacitated arc routing problems using a transformation to the CVRP. 1823-1837 - Jean-François Bérubé, Jean-Yves Potvin, Jean G. Vaucher:
Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem. 1838-1856 - Der-Chiang Li, Chih-Sen Wu, Tung-I Tsai, Fengming M. Chang:
Using mega-fuzzification and data trend estimation in small data set learning for early FMS scheduling knowledge. 1857-1869
Volume 33, Number 7, July 2006
- William J. Hurley:
Special issue on operations research in sport. 1871-1873 - Mike B. Wright:
Scheduling fixtures for Basketball New Zealand. 1875-1893 - Robert A. Russell, Timothy L. Urban:
A constraint programming approach to the multiple-venue, sport-scheduling problem. 1895-1906 - Thomas Bartsch, Andreas Drexl, Stefan Kröger:
Scheduling the professional soccer leagues of Austria and Germany. 1907-1937 - Tim B. Swartz, Paramjit S. Gill, David Beaudoin, Basil M. deSilva:
Optimal batting orders in one-day cricket. 1939-1950 - Maciek Nowak, Marina A. Epelman, Stephen M. Pollock:
Assignment of swimmers to dual meet events. 1951-1962 - Federico Della Croce, Dario Oliveri:
Scheduling the Italian Football League: an ILP-based approach. 1963-1974 - Ryuhei Miyashiro, Tomomi Matsui:
Semidefinite programming based approaches to the break minimization problem. 1975-1982 - Donald E. K. Martin:
Hot-hand effects in sports and a recursive method of computing probabilities for streaks. 1983-2001 - Andrew M. Flitman:
Towards probabilistic footy tipping: a hybrid approach utilising genetically defined neural networks and linear programming. 2003-2022 - Kent J. Kostuk, Keith A. Willoughby:
Curling's paradox. 2023-2031 - Mingming Leng, Mahmut Parlar:
Game-theoretic analysis of an ancient Chinese horse race problem. 2033-2055 - Leonid Churilov, Andrew M. Flitman:
Towards fair ranking of Olympics achievements: the case of Sydney 2000. 2057-2082
Volume 33, Number 8, August 2006
- George Mavrotas, Panagiotis Trifillis:
Multicriteria decision analysis with minimum information: combining DEA with MAVT. 2083-2098 - Wen-Hung Kuo, Dar-Li Yang:
Single-machine group scheduling with a time-dependent learning effect. 2099-2112 - Víctor M. Albornoz, Cristian M. Canales:
Total allowable catch for managing squat lobster fishery using stochastic nonlinear programming. 2113-2124 - Wen Qi Huang, Yu Li, Chu Min Li, Ru Chu Xu:
New heuristics for packing unequal circles into a circular container. 2125-2142 - Joachim Breit:
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. 2143-2153 - Tatjana Davidovic, Teodor Gabriel Crainic:
Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. 2155-2177 - Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a bidding problem. 2179-2188 - Corinne Lucet, Florence Mendes, Aziz Moukrim:
An exact method for graph coloring. 2189-2207 - Defu Zhang, Yan Kang, Ansheng Deng:
A new heuristic recursive algorithm for the strip rectangular packing problem. 2209-2217 - Menouar Boulif, Karim Atif:
A new branch-&-bound-enhanced genetic algorithm for the manufacturing cell formation problem. 2219-2245 - Peter Zörnig:
Systematic construction of examples for cycling in the simplex method. 2247-2262 - Piya Chootinan, Anthony Chen:
Constraint handling in genetic algorithms using a gradient-based repair method. 2263-2281 - Michiel A. Odijk, H. Edwin Romeijn, Hans van Maaren:
Generation of classes of robust periodic railway timetables. 2283-2299 - Wooseung Jang:
Production and allocation policies in a two-class inventory system with time and quantity dependent waiting costs. 2301-2321 - Roger Z. Ríos-Mercado, Seongbae Kim, E. Andrew Boyd:
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures. 2323-2351 - Anne Setämaa-Kärkkäinen, Kaisa Miettinen, Jarkko Vuori:
Best compromise solution for a new multiobjective scheduling problem. 2353-2368 - Nandamudi Lankalapalli Vijaykumar, Solon Venâncio de Carvalho, Valéria Maria Barros de Andrade, Vakulathil Abdurahiman:
Introducing probabilities in Statecharts to specify reactive systems for performance analysis. 2369-2386 - Ahmad Diponegoro, Bhaba R. Sarker:
Finite horizon planning for a production system with permitted shortage and fixed-interval deliveries. 2387-2404 - Stefan Irnich, Birger Funke, Tore Grünert:
Sequential search and its application to vehicle-routing problems. 2405-2429 - Alan R. McKendall Jr., Jin Shang, Saravanan Kuppusamy:
Simulated annealing heuristics for the dynamic facility layout problem. 2431-2444
- Saul I. Gass, Sasirekha Vinjamuri:
Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311]. 2445-
Volume 33, Number 9, September 2006
- Alain Hertz:
Anniversary focused issue of Computers & Operations Research on tabu search. 2447-2448 - Fred W. Glover:
Parametric tabu-search for mixed integer programs. 2449-2494 - Manuel Laguna:
Implementing and testing the tabu cycle and conditional probability methods. 2495-2507 - Halvard Arntzen, Lars Magnus Hvattum, Arne Løkketangen:
Adaptive memory search for multidemand multidimensional knapsack problems. 2508-2525 - Ibrahim H. Osman:
A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem. 2526-2546 - Philippe Galinier, Alain Hertz:
A survey of local search methods for graph coloring. 2547-2562 - Minghe Sun:
Solving the uncapacitated facility location problem using tabu search. 2563-2589 - Peter Greistorfer, César Rego:
A simple filter-and-fan approach to the facility location problem. 2590-2601 - Teodor Gabriel Crainic, Ye Li, Michel Toulouse:
A first multilevel cooperative algorithm for capacitated multicommodity network design. 2602-2622 - Jean-Paul Watson, Adele E. Howe, L. Darrell Whitley:
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem. 2623-2644
- Xiangtong Qi, Jonathan F. Bard:
Generating labor requirements and rosters for mail handlers using simulation and optimization. 2645-2666 - Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi:
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. 2667-2702 - Ann Melissa Campbell:
Aggregation for the probabilistic traveling salesman problem. 2703-2724 - Othman Ibraheem Alsalloum, Graham K. Rand:
Extensions to emergency vehicle location models. 2725-2743 - Horacio Hideki Yanasse, Marcelo Saraiva Limeira:
A hybrid heuristic to reduce the number of different patterns in cutting stock problems. 2744-2756 - Sotirios G. Dimitriadis:
Assembly line balancing and group working: A heuristic procedure for workers' groups operating on the same product and workstation. 2757-2774
Volume 33, Number 10, October 2006
- Michel Gendreau, Gilles Pesant, Louis-Martin Rousseau:
Focused issue of C & OR on constraint programming. 2775-2776 - Alexander Bockmayr, Nicolai Pisaruk:
Detecting infeasibility and generating cuts for mixed integer programming using constraint programming. 2777-2786 - Willem Jan van Hoeve:
Exploiting semidefinite relaxations in constraint programming. 2787-2804 - Simon de Givry, Laurent Jeannin:
A unified framework for partial and hybrid search methods in constraint programming. 2805-2833 - Nicolas Beldiceanu, Mats Carlsson, Sven Thiel:
Sweep synchronization as a global propagation mechanism. 2835-2851 - François Fages, Akash Lal:
A constraint programming approach to cutset problems. 2852-2865 - Stefan Bertels, Torsten Fahle:
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. 2866-2890 - Samir Loudni, Patrice Boizumault, Philippe David:
On-line resources allocation for ATM networks with rerouting. 2891-2917 - Mattias Grönkvist:
Accelerating column generation for aircraft scheduling using constraint propagation. 2918-2934 - Christopher Jefferson, Angela Miguel, Ian Miguel, Armagan Tarim:
Modelling and solving English Peg Solitaire. 2935-2959
- Ling Wang, Liang Zhang, Da-Zhong Zheng:
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. 2960-2971 - Alain Chabrier:
Vehicle Routing Problem with elementary shortest path based column generation. 2972-2990 - Isabel Correia, M. Eugénia V. Captivo:
Bounds for the single source modular capacitated plant location problem. 2991-3003 - Sebastián Lozano, Gabriel Villa:
Data envelopment analysis of integer-valued inputs and outputs. 3004-3014 - Moshe Kaspi, Dvir Shabtay:
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. 3015-3033 - Pierre Hansen, Nenad Mladenovic, Dragan Urosevic:
Variable neighborhood search and local branching. 3034-3045 - Elías F. Combarro, Pedro Miranda:
Identification of fuzzy measures from sample data with genetic algorithms. 3046-3066
Volume 33, Number 11, November 2006
- Sigurdur Ólafsson:
Introduction to operations research and data mining. 3067-3069 - Roselyn Abbiw-Jackson, Bruce L. Golden, S. Raghavan, Edward A. Wasil:
A divide-and-conquer local search heuristic for data visualization. 3070-3087 - Jaekyung Yang, Sigurdur Ólafsson:
Optimization-based feature selection with adaptive instance sampling. 3088-3106 - Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets:
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization. 3107-3123 - Parag C. Pendharkar:
A data mining-constraint satisfaction optimization problem for cost effective classification. 3124-3135 - John Francis Kros, Mike Lin, Marvin L. Brown:
Effects of the neural network s-Sigmoid function on KDD in the presence of imprecise data. 3136-3149 - Carol J. Romanowski, Rakesh Nagi, Moises Sudit:
Data mining in an engineering design environment: OR applications from graph matching. 3150-3160 - Chienwen Wu:
Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse. 3161-3170 - Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Mining market data: A network approach. 3171-3184
- Zhiwei Fu, Bruce L. Golden, Shreevardhan Lele, S. Raghavan, Edward A. Wasil:
Diversification for better classification trees. 3185-3202 - Kun-Nyeong Chang, Ki-Dong Lee, Dongwoo Kim:
Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems. 3203-3218 - Jakub Bauman, Joanna Józefowska:
Minimizing the earliness-tardiness costs on a single machine. 3219-3230 - Sandra Duni Eksioglu, H. Edwin Romeijn, Panos M. Pardalos:
Cross-facility management of production and transportation planning problem. 3231-3251 - Tal Shima, Steven J. Rasmussen, Andrew G. Sparks, Kevin M. Passino:
Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms. 3252-3269 - Natashia Boland, Patricia Domínguez-Marín, Stefan Nickel, Justo Puerto:
Exact procedures for solving the discrete ordered median problem. 3270-3300 - Ye Chen, D. Marc Kilgour, Keith W. Hipel:
Multiple criteria classification with an application in water resources planning. 3301-3323 - Liping Fu, Dihua Sun, Laurence R. Rilett:
Heuristic shortest path algorithms for transportation applications: State of the art. 3324-3343 - Lixin Tang, Hua Xuan, Jiyin Liu:
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time. 3344-3359
Volume 33, Number 12, December 2006
- Gianpaolo Ghiani, Roberto Musmanno:
Recent algorithmic advances for Arc Routing Problems. 3361-3362 - José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins:
Lower and upper bounds for the mixed capacitated arc routing problem. 3363-3383 - Angel Corberán, Enrique Mota, José M. Sanchis:
A comparison of two different formulations for arc routing problems on mixed graphs. 3384-3402 - Dino Ahr, Gerhard Reinelt:
A tabu search algorithm for the min-max k-Chinese postman problem. 3403-3422 - U. F. Aminu, Richard W. Eglese:
A constraint programming approach to the Chinese postman problem with time windows. 3423-3431 - Julián Aráoz, Elena Fernández, Cristina Zoltan:
Privatized rural postman problems. 3432-3449 - Gianpaolo Ghiani, Demetrio Laganà, Roberto Musmanno:
A constructive heuristic for the Undirected Rural Postman Problem. 3450-3457 - Sanne Wøhlk:
New lower bound for the Capacitated Arc Routing Problem. 3458-3472 - Philippe Lacomme, Christian Prins, Marc Sevaux:
A genetic algorithm for a bi-objective capacitated arc routing problem. 3473-3493 - Fabien Marzolf, Martin Trépanier, André Langevin:
Road network monitoring: algorithms and a case study. 3494-3507
- Richard W. Eglese, Will Maden, Alan Falconer Slater:
A Road TimetableTM to aid vehicle routing and scheduling. 3508-3519 - Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana:
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems. 3520-3534 - Ernesto G. Birgin, José Mario Martínez, F. H. Nishihara, Débora P. Ronconi:
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. 3535-3548 - Carlos G. García-González, Dionisio Pérez-Brito, Vicente Campos, Rafael Martí:
Variable neighborhood search for the linear ordering problem. 3549-3565 - Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura:
Euclidean push-pull partial covering problems. 3566-3582 - Wilco van den Heuvel, Albert P. M. Wagelmans:
An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem. 3583-3599 - Nafee Rizk, Alain Martel, Sophie D'Amours:
Multi-item dynamic production-distribution planning in process industries with divergent finishing stages. 3600-3623 - Byung-In Kim, Seongbae Kim, Surya Sahoo:
Waste collection vehicle routing problem with time windows. 3624-3642
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-11-22 00:30 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:
