Inhaltsverzeichnis
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. - Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. - Solving Chance-Constrained Programs Combining Tabu Search and Simulation. - An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation. - On an Experimental Algorithm for Revenue Management for Cargo Airlines. - Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem. - Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4 s. - A Randomized Heuristic for Scene Recognition by Graph Matching. - An Efficient Implementation of a Joint Generation Algorithm. - Lempel, Even, and Cederbaum Planarity Method. - A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique. - Distributed Circle Formation for Anonymous Oblivious Robots. - Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems. - Engineering Shortest Path Algorithms. - How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas. - Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem. - Fingered Multidimensional Search Trees. - Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. - Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm. - Combining Speed-Up Techniques for Shortest-Path Computations. - Increased Bit-Parallelism for Approximate String Matching. - The Role of Experimental Algorithms in Genomics. - A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. - Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. - An Experimental Study of UnrankingAlgorithms. - An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. - GRASP with Path-Relinking for the Quadratic Assignment Problem. - Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks. - A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs. - Approximating Interval Coloring and Max-Coloring in Chordal Graphs. - A Statistical Approach for Algorithm Selection. - An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization. - A Huffman-Based Error Detecting Code. - Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. - An Efficient Tabu Search Heuristic for the School Timetabling Problem. - Experimental Studies of Symbolic Shortest-Path Algorithms. - Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem. - Using Compact Tries for Cache-Efficient Sorting of Integers. - Using Random Sampling to Build Approximate Tries for Efficient String Sorting. - The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation. - An Analytical Model for Energy Minimization. - A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes.
