Sciweavers

21 search results - page 2 / 5
» A comparison of two different formulations for arc routing p...
Sort
View
4OR
2010
148views more  4OR 2010»
13 years 4 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ANOR
2005
102views more  ANOR 2005»
13 years 5 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
JMLR
2010
161views more  JMLR 2010»
13 years 14 days ago
Accuracy-Rejection Curves (ARCs) for Comparing Classification Methods with a Reject Option
Data extracted from microarrays are now considered an important source of knowledge about various diseases. Several studies based on microarray data and the use of receiver operat...
Malik Sajjad Ahmed Nadeem, Jean-Daniel Zucker, Bla...
TVCG
2011
120views more  TVCG 2011»
13 years 18 days ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
ATMOS
2007
119views Optimization» more  ATMOS 2007»
13 years 7 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte