2109 search results - page 27 / 422 » Solving Necklace Constraint Problems |
139
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
135
click to vote
EOR
2008
15 years 4 months ago
2008
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
147
click to vote
E4MAS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Even if the multi-agent paradigm has been evolving for fifteen years, the development of concrete methods for problem solving remains a major challenge. This paper focus...
140
click to vote
ASIAMS
2007
IEEE
15 years 10 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
137
click to vote
KI
2007
Springer
15 years 4 months ago
2007
Springer
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...