Sciweavers

540 search results - page 8 / 108
» Competitive Routing over Time
Sort
View
EOR
2008
133views more  EOR 2008»
15 years 4 months ago
Vehicle routing with dynamic travel times: A queueing approach
Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assig...
Tom Van Woensel, Laoucine Kerbache, Herbert Perema...
COR
2011
14 years 11 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
LR
2011
156views more  LR 2011»
14 years 11 months ago
The assessment of competitive intensity in logistics markets
Scopus is the world’s largest abstract and citation database of peer-reviewed literature and quality web sources (-> http://www.info.sciverse.com/scopus). ontains 41 million r...
Peter Klaus
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
15 years 9 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang
INFOCOM
2010
IEEE
15 years 3 months ago
Non-Preemptive Buffer Management for Latency Sensitive Packets
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
Moran Feldman, Joseph Naor