Re: Military logistic problem
- From: iatsonios@xxxxxxxxx
- Date: 13 Jul 2006 02:18:59 -0700
Unfortunately you are not very descriptive and give few elements about
the problem you have to adress.I believe that you problem may lie in
the field of Operational Research and belongs also in CS,because is a
programming(e.x linear,quadratic,etc).In case your problem can be
formulated as a set of linear inequation(linear programming),you can
apply a variety of techniques to find solution,hopefully enough you
problem can be solved in polynomial time.In case you problem is a
variant of linear programming,which is called integer programming,then
it is NP complete(the reduction is quite easy from the 3sat),so you
need exponential amount to solve it,on the other hand in case you don;t
need the optimal solution,then there are a quite well established
approximation techniques such as simulatead annealing,A* search
algorithms,randomized versions etc.some of them are quite robust and
can give you an index for the approximation ratio.
Please be more specific with your description.In case you need
something,you can email me.
Cheers
Yannis
.
- References:
- Military logistic problem
- From: christriddle
- Military logistic problem
- Prev by Date: Re: Mapping rationals to binary strings while preserving order
- Next by Date: Re: solving #SAT in poly(number of vars) and exp(number of clauses)?
- Previous by thread: Military logistic problem
- Next by thread: Re: Military logistic problem
- Index(es):
Relevant Pages
|
