13376 search results - page 308 / 2676 » Problem Solving with |
125
click to vote
ISSAC
2004
Springer
15 years 9 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
113
Voted
TRANSCI
2011
14 years 11 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
126
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
127
click to vote
TRANSCI
2002
15 years 3 months ago
2002
Vendor managed inventory replenishment is a business practice in which vendors monitor their customers' inventories, and decide when and how much inventory should be replenis...
133
click to vote
DISOPT
2008
15 years 4 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...