1182 search results - page 32 / 237 » Iterative Methods in Combinatorial Optimization |
116
Voted
MOC
2002
15 years 2 months ago
2002
This paper proposes a new Newton-like method which defines new iterates using a linear system with the same coefficient matrix in each iterate, while the correction is performed on...
193
Voted
TELSYS
2011
14 years 9 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
104
click to vote
APSCC
2007
IEEE
15 years 9 months ago
2007
IEEE
A suitable assignment of agents to handle the workload at a call center is not easy to fulfill because it requires a combinatorial optimization with large solution space and the n...
117
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1, which uses explicitly modeling of the s...
135
Voted
CP
2009
Springer
15 years 9 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...