Working Paper |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A Competitive Genetic Algorithm for Single Row Facility Layout |
0 |
0 |
0 |
9 |
0 |
0 |
3 |
40 |

A Competitive Genetic Algorithm for Single Row Facility Layout |
0 |
0 |
1 |
17 |
0 |
0 |
3 |
79 |

A Diversification Operator for Genetic Algorithms |
0 |
0 |
0 |
17 |
0 |
2 |
7 |
72 |

A Lin-Kernighan Heuristic for Single Row Facility Layout |
0 |
0 |
0 |
12 |
0 |
0 |
0 |
77 |

A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem |
0 |
2 |
6 |
27 |
2 |
5 |
16 |
103 |

A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem |
0 |
1 |
1 |
10 |
0 |
2 |
3 |
15 |

A new genetic algorithm for the tool indexing problem |
0 |
2 |
4 |
24 |
0 |
5 |
11 |
40 |

Allocating tools to index positions in tool magazines using tabu search |
0 |
1 |
1 |
13 |
0 |
1 |
3 |
26 |

An Exponential Neighborhood Local Search Algorithm for the Single Row Facility Location Problem |
0 |
0 |
0 |
10 |
0 |
1 |
1 |
59 |

Branch and peg algorithms for the simple plant location problem |
0 |
0 |
1 |
1 |
0 |
0 |
5 |
14 |

Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem |
0 |
1 |
5 |
31 |
0 |
2 |
16 |
81 |

Complete local search with memory |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
11 |

Complexity of determining exact tolerances for min-max combinatorial optimization problems |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
10 |

Data Correcting Algorithms in Combinatorial Optimization |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
26 |

Data Correcting: A Methodologyfor obtaining near-optimal solutions |
0 |
0 |
0 |
1 |
0 |
0 |
3 |
15 |

Discrete optimization problems with random cost elements |
0 |
0 |
0 |
1 |
0 |
1 |
4 |
12 |

Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information |
0 |
0 |
0 |
1 |
0 |
0 |
4 |
12 |

Equivalent instances of the simple plant location problem |
0 |
1 |
1 |
3 |
0 |
1 |
2 |
15 |

Exploring Lin Kernighan neighborhoods for the indexing problem |
0 |
3 |
3 |
17 |
1 |
4 |
7 |
37 |

Identifying defective valves in a blowout preventer valve network |
0 |
0 |
0 |
5 |
0 |
1 |
3 |
16 |

Incorporating gender and age in genetic algorithms to solve the indexing problem |
0 |
1 |
1 |
1 |
0 |
1 |
2 |
4 |

Incorporating gender and age in genetic algorithms to solve the indexing problem |
0 |
0 |
0 |
27 |
0 |
1 |
6 |
26 |

Iterative Patching and the Asymmetric Traveling Salesman Problem |
0 |
0 |
0 |
2 |
0 |
0 |
3 |
25 |

Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem |
0 |
0 |
0 |
1 |
0 |
0 |
3 |
93 |

Obtaining Near OptimalSolutions for the Binary Knapsack Problem |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
21 |

On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks |
0 |
1 |
1 |
47 |
12 |
24 |
57 |
334 |

On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems |
0 |
1 |
3 |
4 |
1 |
2 |
6 |
13 |

Path Relinking for Single Row Facility Layout |
0 |
0 |
1 |
20 |
0 |
0 |
8 |
71 |

Population Heuristics for the Corridor Allocation Problem |
0 |
0 |
7 |
40 |
1 |
4 |
15 |
122 |

Scatter Search Algorithms for the Single Row Facility Layout Problem |
0 |
0 |
0 |
28 |
0 |
0 |
2 |
100 |

Self-organization in a distributed coordination game through heuristic rules |
0 |
0 |
0 |
31 |
0 |
0 |
5 |
28 |

Sensitivity Analysis for the Single Row Facility Layout Problem |
0 |
0 |
0 |
7 |
1 |
1 |
2 |
35 |

Sensitivity analysis of the greedy heuristic for binary knapsack problems |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
12 |

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems |
0 |
0 |
0 |
8 |
1 |
2 |
4 |
38 |

Speeding up neighborhood search for the tool indexing problem |
0 |
0 |
0 |
3 |
0 |
4 |
14 |
37 |

Spotting Difficult Weakly Correlated Binary Knapsack Problems |
0 |
1 |
2 |
15 |
0 |
2 |
6 |
57 |

Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers |
0 |
0 |
0 |
20 |
1 |
1 |
5 |
30 |

Tabu Search for the Single Row Facility Layout Problem Using Exhaustive 2-Opt and Insertion Neighborhoods |
0 |
0 |
0 |
36 |
0 |
0 |
2 |
132 |

Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood |
0 |
0 |
0 |
12 |
0 |
0 |
1 |
70 |

The Data-Correcting Algorithmfor the Maximization of Submodular functions: A Multilevel search in thehasse Diagram |
0 |
0 |
0 |
0 |
0 |
1 |
5 |
19 |

The Single Row Facility Layout Problem: State of the Art |
0 |
0 |
1 |
51 |
2 |
2 |
6 |
198 |

The binary knapsack problem: solutions with guaranteed quality |
0 |
0 |
0 |
1 |
0 |
2 |
4 |
19 |

ï»¿A Multilevel Search Algorithm for the Maximization of Submodular Functions |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
19 |

Total Working Papers |
0 |
15 |
39 |
556 |
22 |
73 |
260 |
2,263 |