Sciweavers

Share
AIR
2004
134views more  AIR 2004»
8 years 11 months ago
Combining Meta-Heuristics to Effectively Solve the Vehicle Routing Problems with Time Windows
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...
Vincent Tam, Keng Teck Ma
JOT
2007
104views more  JOT 2007»
8 years 11 months ago
Common Requirements Problems, Their Negative Consequences, and the Industry Best Practices to Help Solve Them
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...
Donald Firesmith
TSMC
2008
109views more  TSMC 2008»
8 years 11 months ago
Analysis of CCME: Coevolutionary Dynamics, Automatic Problem Decomposition, and Regularization
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...
Minh Ha Nguyen, Hussein A. Abbass, Robert I. McKay
TIT
2008
83views more  TIT 2008»
8 years 12 months ago
Hard Problems of Algebraic Geometry Codes
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...
Qi Cheng
JAIR
2007
141views more  JAIR 2007»
8 years 12 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
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 ...
Alex S. Fukunaga, Richard E. Korf
IOR
2007
106views more  IOR 2007»
8 years 12 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
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...
John N. Hooker
TCBB
2008
101views more  TCBB 2008»
8 years 12 months ago
The Undirected Incomplete Perfect Phylogeny Problem
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...
Ravi Vijaya Satya, Amar Mukherjee
ANOR
2005
89views more  ANOR 2005»
8 years 12 months ago
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
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...
Sangbum Lee, Ignacio E. Grossmann
IJVR
2007
100views more  IJVR 2007»
8 years 12 months ago
The Impact of Social Interaction on Usability for Distributed Virtual Environments
—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...
Ilona Heldal
TASE
2008
IEEE
8 years 12 months ago
Mechanism Design for Single Leader Stackelberg Problems and Application to Procurement Auction Design
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...
Dinesh Garg, Y. Narahari
books