Sciweavers

14386 search results - page 326 / 2878
» The Chinese Generals Problem
Sort
View
DM
2000
89views more  DM 2000»
15 years 6 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
225
Voted
SIAMJO
2002
115views more  SIAMJO 2002»
15 years 5 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov
COR
2008
160views more  COR 2008»
15 years 4 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
IOR
2010
112views more  IOR 2010»
15 years 4 months ago
New Policies for the Stochastic Inventory Control Problem with Two Supply Sources
We study an inventory system under periodic review in the presence of two suppliers (or delivery modes). The emergency supplier has a shorter lead-time than the regular supplier, ...
Anshul Sheopuri, Ganesh Janakiraman, Sridhar Sesha...
JACM
2010
116views more  JACM 2010»
15 years 4 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára