Sciweavers

8780 search results - page 1505 / 1756
» On the Feasibility of Consistent Computations
Sort
View
INFORMS
2010
107views more  INFORMS 2010»
15 years 5 months ago
A Class Representative Model for Pure Parsimony Haplotyping
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
Daniele Catanzaro, Alessandra Godi, Martine Labb&e...
JSW
2010
83views more  JSW 2010»
15 years 5 months ago
Estimating Model Parameters of Conditioned Soils by using Artificial Network
—The parameter identification of nonlinear constitutive model of soil mass is based on an inverse analysis procedure, which consists of minimizing the objective function represen...
Zichang Shangguan, Shouju Li, Wei Sun, Maotian Lua...
MP
2010
145views more  MP 2010»
15 years 5 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
« Prev « First page 1505 / 1756 Last » Next »