Sciweavers

APIN
2005
98views more  APIN 2005»
13 years 4 months ago
3-D Container Packing Heuristics
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...
Andrew Lim, Brian Rodrigues, Y. Yang
ANOR
2005
120views more  ANOR 2005»
13 years 4 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
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...
Krishna Chepuri, Tito Homem-de-Mello
RSA
2006
68views more  RSA 2006»
13 years 4 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: 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...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
SIAMSC
2008
193views more  SIAMSC 2008»
13 years 4 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
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. ...
Sadegh Jokar, Marc E. Pfetsch
EOR
2007
108views more  EOR 2007»
13 years 4 months ago
How much information do we need?
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...
Peter M. Todd
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
13 years 4 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
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...
Jonas Mockus
EOR
2006
118views more  EOR 2006»
13 years 4 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
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...
Lawrence V. Snyder, Mark S. Daskin
EOR
2006
48views more  EOR 2006»
13 years 4 months ago
Experimental investigation of heuristics for resource-constrained project scheduling: An update
This paper considers heuristics for the well
Rainer Kolisch, Sönke Hartmann
DAM
2006
89views more  DAM 2006»
13 years 4 months ago
First vs. best improvement: An empirical study
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...
Pierre Hansen, Nenad Mladenovic
COR
2006
118views more  COR 2006»
13 years 4 months ago
Simulated annealing heuristics for the dynamic facility layout problem
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...
Alan R. McKendall Jr., Jin Shang, Saravanan Kuppus...