372 search results - page 35 / 75 » The box mover problem |
WSC
1997
15 years 1 months ago
1997
In this paper, the case of a cardboard box marketing firm is studied and a (R,s,Q,c) inventory replenishment policy is proposed and evaluated by means of discrete event simulation...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based on t...
MP
2006
14 years 11 months ago
2006
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
AUTOMATICA
2000
14 years 11 months ago
2000
: For a large class of bounded-error estimation problems, the posterior feasible set 5 for the parameters can be dened by nonlinear inequalities. The set-inversion approach combine...
105
click to vote
IPCO
2010
14 years 9 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...