APIN
2005
14 years 8 hour ago
2005
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a f...
ANOR
2005
14 years 8 hour ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
RSA
2006
14 years 15 hour ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
SIAMSC
2008
14 years 16 hour ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
EOR
2007
14 years 1 days ago
2007
ct 7 Modern technology is succeeding in delivering more information to people at ever faster rates. Under traditional 8 views of rational decision making where individuals should e...
INFORMATICALT
2006
14 years 2 days ago
2006
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
EOR
2006
14 years 3 days ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
EOR
2006
14 years 3 days ago
2006
This paper considers heuristics for the well
DAM
2006
14 years 3 days ago
2006
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than selecting the first impr...
COR
2006
14 years 4 days ago
2006
In today's economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in product mix and demand. Therefore, this paper considers the pro...