Results 71 to 80 of about 2,726,346 (131)
A Genetic Algorithm for the P-median Problem [PDF]
, 2001 Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem.
Steiner, Maria Teresinha A. +3 more
core
A Local Search Algorithm for Clustering in Software as a Service Networks [PDF]
In this paper we present and analyze a model for clustering in networks that offer Software as a Service (SaaS). In this problem, organizations requesting a set of applications have to be assigned to clusters such that the costs of opening clusters and ...
Gaast, J.P. van der +3 more
core
Complete local search with memory [PDF]
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we
Sierksma, G., Ghosh, D.
core
A tabu search procedure for generating robust project baseline schedules under stochastic resource availabilities. [PDF]
The majority of research efforts in project scheduling assume a static and deterministic environment with complete information. In practice, however, these assumptions will hardly, if ever, be satisfied.
Lambrechts, Olivier +2 more
core
Tabu Search for the Single Row Facility Layout Problem in FMS using a 3-opt Neighborhood [PDF]
Since material handling agents in a FMS are most efficient when moving in straight lines, a common layout of machines in a FMS is a single row layout. This allows a floor designer to model the problem of generating an optimal machine layout in a FMS as a
Kothari, Ravi, Ghosh, Diptesh
core
Consumer choice in competitive location models: Formulations and heuristics [PDF]
A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs ...
Rosa Colomé, Daniel Serra
core
Local search methods for the discrete time/resource trade-off problem in project networks. [PDF]
: In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations specifying that an activity can only start when al of its ...
De Reyck, B, Demeulemeester, Erik
core
A tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
Given an undirected and vertex weighted graph G = (V,E,w), the Weighted Feedback Vertex Problem (WFVP) consists of finding a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F.
Gentili, Monica +3 more
core +1 more source