AIR
2004
13 years 4 months ago
2004
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
JOT
2007
13 years 4 months ago
2007
In this column, I summarize the 12 worst of the most common requirements engineering problems I have observed over many years working on and with real projects as a requirements e...
TSMC
2008
13 years 4 months ago
2008
In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...
TIT
2008
13 years 4 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
JAIR
2007
13 years 4 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
IOR
2007
13 years 4 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
TCBB
2008
13 years 4 months ago
2008
The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or g...
ANOR
2005
13 years 4 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
IJVR
2007
13 years 4 months ago
2007
—Distance collaboration has long been a research area for distributed Virtual Environments (VEs). In these environments people interact with the technology and each other in a co...
TASE
2008
IEEE
13 years 4 months ago
2008
IEEE
In this paper, we focus on mechanism design for single leader Stackelberg problems, which are a special case of hierarchical decision making problems in which a distinguished agent...