Sciweavers

810 search results - page 9 / 162
» Solving Time-Dependent Planning Problems
Sort
View
EVOW
2007
Springer
14 years 2 months ago
A Hybrid Method for Solving Large-Scale Supply Chain Problems
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
Steffen Wolf, Peter Merz
COR
2008
88views more  COR 2008»
13 years 8 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
ML
1998
ACM
220views Machine Learning» more  ML 1998»
13 years 7 months ago
Learning to Improve Coordinated Actions in Cooperative Distributed Problem-Solving Environments
Abstract. Coordination is an essential technique in cooperative, distributed multiagent systems. However, sophisticated coordination strategies are not always cost-effective in all...
Toshiharu Sugawara, Victor R. Lesser
EVOW
2004
Springer
14 years 1 months ago
Solving a Real-World Glass Cutting Problem
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
Jakob Puchinger, Günther R. Raidl, Gabriele K...
GECCO
2004
Springer
111views Optimization» more  GECCO 2004»
14 years 1 months ago
Cooperative Problem Solving Using an Agent-Based Market
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...
David Cornforth, Michael Kirley