Sciweavers

WEA
2010
Springer
241views Algorithms» more  WEA 2010»
14 years 7 months ago
A Branch-and-Price Algorithm for Multi-mode Resource Leveling
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Eamonn T. Coughlan, Marco E. Lübbecke, Jens S...
WEA
2010
Springer
344views Algorithms» more  WEA 2010»
14 years 7 months ago
Alternative Routes in Road Networks
We study the problem of finding good alternative routes in road networks. We look for routes that are substantially different from the shortest path, have small stretch, and are ...
Ittai Abraham, Daniel Delling, Andrew V. Goldberg,...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
14 years 7 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
WEA
2010
Springer
245views Algorithms» more  WEA 2010»
14 years 7 months ago
Contraction of Timetable Networks with Realistic Transfers
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
Robert Geisberger
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
14 years 7 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 7 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
14 years 7 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
14 years 7 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
14 years 7 months ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
14 years 7 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard