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 |
18 |
0 |
0 |
1 |
82 |

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

A Diversification Operator for Genetic Algorithms |
0 |
0 |
0 |
18 |
0 |
1 |
1 |
76 |

A Lin-Kernighan Heuristic for Single Row Facility Layout |
0 |
0 |
1 |
13 |
0 |
0 |
2 |
83 |

A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem |
0 |
0 |
0 |
27 |
0 |
0 |
1 |
107 |

A Quadratic Programming Formulation of the Equidistant Bi-directional Loop Layout Problem |
0 |
0 |
0 |
11 |
0 |
0 |
0 |
21 |

A new genetic algorithm for the tool indexing problem |
1 |
1 |
1 |
27 |
2 |
2 |
2 |
48 |

Allocating tools to index positions in tool magazines using tabu search |
0 |
0 |
0 |
15 |
0 |
0 |
1 |
38 |

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

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

Comparing Genetic Algorithm Crossover and Mutation Operators for the Indexing Problem |
0 |
0 |
0 |
31 |
0 |
0 |
0 |
84 |

Complete local search with memory |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
16 |

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

Data Correcting Algorithms in Combinatorial Optimization |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
28 |

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

Discrete optimization problems with random cost elements |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
13 |

Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
20 |

Equivalent instances of the simple plant location problem |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
22 |

Exploring Lin Kernighan neighborhoods for the indexing problem |
0 |
0 |
0 |
21 |
0 |
0 |
2 |
54 |

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

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

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

Iterative Patching and the Asymmetric Traveling Salesman Problem |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
30 |

Neighborhood Search Heuristicsfor the Uncapacitated Facility Location Problem |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
98 |

Obtaining Near OptimalSolutions for the Binary Knapsack Problem |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
22 |

On the Blowout Preventer Testing Problem: An Approach to Checking for Leakage in BOP Networks |
0 |
0 |
1 |
50 |
1 |
2 |
4 |
424 |

On the complexity of determining tolerances for ->e--optimal solutions to min-max combinatorial optimization problems |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
18 |

Path Relinking for Single Row Facility Layout |
0 |
0 |
0 |
20 |
0 |
0 |
0 |
73 |

Population Heuristics for the Corridor Allocation Problem |
0 |
0 |
1 |
49 |
1 |
1 |
12 |
162 |

Scatter Search Algorithms for the Single Row Facility Layout Problem |
0 |
1 |
1 |
29 |
0 |
1 |
1 |
106 |

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

Sensitivity Analysis for the Single Row Facility Layout Problem |
0 |
0 |
0 |
7 |
0 |
0 |
0 |
39 |

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

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems |
0 |
0 |
0 |
8 |
1 |
1 |
1 |
40 |

Speeding up neighborhood search for the tool indexing problem |
0 |
0 |
0 |
3 |
0 |
0 |
1 |
46 |

Spotting Difficult Weakly Correlated Binary Knapsack Problems |
0 |
0 |
3 |
18 |
0 |
0 |
10 |
73 |

Tabu Search for Multi-Period Facility Location: Uncapacitated Problem with an Uncertain Number of Servers |
0 |
0 |
0 |
21 |
0 |
0 |
0 |
34 |

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

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

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

The Single Row Facility Layout Problem: State of the Art |
0 |
0 |
0 |
53 |
0 |
0 |
3 |
206 |

The binary knapsack problem: solutions with guaranteed quality |
0 |
0 |
0 |
3 |
0 |
1 |
3 |
35 |

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

Total Working Papers |
1 |
2 |
9 |
596 |
6 |
11 |
54 |
2,612 |