| A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling | p. 1 |
| Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases | p. 14 |
| Solving Chance-Constrained Programs Combining Tabu Search and Simulation | p. 30 |
| An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation | p. 42 |
| On an Experimental Algorithm for Revenue Management for Cargo Airlines | p. 57 |
| Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem | p. 72 |
| Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's | p. 87 |
| A Randomized Heuristic for Scene Recognition by Graph Matching | p. 100 |
| An Efficient Implementation of a Joint Generation Algorithm | p. 114 |
| Lempel, Even, and Cederbaum Planarity Method | p. 129 |
| A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique | p. 145 |
| Distributed Circle Formation for Anonymous Oblivious Robots | p. 159 |
| Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems | p. 175 |
| Engineering Shortest Path Algorithms | p. 191 |
| How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas | p. 199 |
| Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem | p. 213 |
| Fingered Multidimensional Search Trees | p. 228 |
| Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem | p. 243 |
| Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm | p. 253 |
| Combining Speed-Up Techniques for Shortest-Path Computations | p. 269 |
| Increased Bit-Parallelism for Approximate String Matching | p. 285 |
| The Role of Experimental Algorithms in Genomics | p. 299 |
| A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets | p. 301 |
| Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem | p. 315 |
| An Experimental Study of Unranking Algorithms | p. 326 |
| An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem | p. 341 |
| GRASP with Path-Relinking for the Quadratic Assignment Problem | p. 356 |
| Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks | p. 369 |
| A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs | p. 383 |
| Approximating Interval Coloring and Max-Coloring in Chordal Graphs | p. 399 |
| A Statistical Approach for Algorithm Selection | p. 417 |
| An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization | p. 432 |
| A Huffman-Based Error Detecting Code | p. 446 |
| Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs | p. 458 |
| An Efficient Tabu Search Heuristic for the School Timetabling Problem | p. 468 |
| Experimental Studies of Symbolic Shortest-Path Algorithms | p. 482 |
| Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem | p. 498 |
| Using Compact Tries for Cache-Efficient Sorting of Integers | p. 513 |
| Using Random Sampling to Build Approximate Tries for Efficient String Sorting | p. 529 |
| The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation | p. 545 |
| An Analytical Model for Energy Minimization | p. 559 |
| A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes | p. 570 |
| Author Index | p. 585 |
| Table of Contents provided by Publisher. All Rights Reserved. |