Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Experimental and Efficient Algorithms: Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings > An Experimental Study of Unranking Algorithms
Experimental and Efficient Algorithms: Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings |
Celso C. Ribeiro; Simone L. Martins
Springer Berlin Heidelberg
Experimental and Efficient Algorithms: Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings
An Experimental Study of Unranking Algorithms
Authors

Conrado Martínez; Xavier Molinero

ARI Id

1665037963498_4569668

Access

Not Available Free

Pages

326-340

DOI

10.1007/978-3-540-24838-5_25

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-24838-5_25

Table of Contents of Book
Showing 1 to 20 of 44 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling
Adriana C. F. Alvim; Celso C. Ribeiro
1-13
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
Edoardo Amaldi; Leo Liberti; Nelson Maculan; Francesco Maffioli
14-29
Solving Chance-Constrained Programs Combining Tabu Search and Simulation
Roberto Aringhieri
30-41
An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation
Pedro J. Ballester; Jonathan N. Carter
42-56
On an Experimental Algorithm for Revenue Management for Cargo Airlines
Paul Bartodziej; Ulrich Derigs
57-71
Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem
Matthieu Basseur; Julien Lemesre; Clarisse Dhaenens; El-Ghazali Talbi
72-86
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4’s
Hans L. Bodlaender; Celina M. H. de Figueiredo; Marisa Gutierrez; Ton Kloks; Rolf Niedermeier
87-99
A Randomized Heuristic for Scene Recognition by Graph Matching
Maria C. Boeres; Celso C. Ribeiro; Isabelle Bloch
100-113
An Efficient Implementation of a Joint Generation Algorithm
Endre Boros; Khaled Elbassioni; Vladimir Gurvich; Leonid Khachiyan
114-128
Lempel, Even, and Cederbaum Planarity Method
John M. Boyer; Cristina G. Fernandes; Alexandre Noma; José C. de Pina
129-144
A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique
Evandro C. Bracht; Luis A. A. Meira; Flávio K. Miyazawa
145-158
Distributed Circle Formation for Anonymous Oblivious Robots
Ioannis Chatzigiannakis; Michael Markou; Sotiris Nikoletseas
159-174
Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems
Glauber Cintra; Yoshiko Wakabayashi
175-190
Engineering Shortest Path Algorithms
Camil Demetrescu; Giuseppe F. Italiano
191-198
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas
Tassos Dimitriou; Paul Spirakis
199-212
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
Jingde Du; Stavros G. Kolliopoulos
213-227
Fingered Multidimensional Search Trees
Amalia Duch; Conrado Martínez
228-242
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
Celina M. H. de Figueiredo; Guilherme D. da Fonseca; Vinícius G. P. de Sá; Jeremy Spinrad
243-252
Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm
Erik J. Hanashiro; Henrique Mongelli; Siang W. Song
253-268
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 44 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings