Sciweavers

1054 search results - page 77 / 211
» Capacitated Domination Problem
Sort
View
ORGSCI
2008
54views more  ORGSCI 2008»
15 years 3 months ago
On the Problem of Participation in Strategy: A Critical Discursive Perspective
We still know little of why strategy processes often involve participation problems. In this paper, we argue that this crucial issue is linked to fundamental assumptions concernin...
Saku Mantere, Eero Vaara
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 6 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
CEC
2005
IEEE
15 years 5 months ago
Multi-objective optimisation of the pump scheduling problem using SPEA2
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
Manuel López-Ibáñez, T. Devi ...
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 4 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
AAAI
2000
15 years 4 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...