Results 211 to 220 of about 10,098 (246)
Some of the next articles are maybe not open access.
An augmenting path method for solving Linear Bottleneck Assignment problems
Computing, 1978An efficient method for solving Linear Bottleneck Assignment problems is described. The method starts with a heuristically determined partial assignment. Then shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed.
Ulrich Derigs, Uwe Zimmermann
openaire +3 more sources
A shortest augmenting path method for solving minimal perfect matching problems
Networks, 1981AbstractAn efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique.
Ulrich Derigs
openaire +3 more sources
An augmenting path method for solving Linear Bottleneck Transportation problems
Computing, 1979An efficient method for solving Linear Bottleneck Transportation problems is described. The method starts with a heuristically determined lower bound for the optimal value. Shortest augmenting paths are constructed with the aid of a modification of the algorithm of Dijkstra. Comprehensive numerical investigations are reported and discussed.
Ulrich Derigs, Uwe Zimmermann
openaire +3 more sources
Annals of Operations Research, 1985
In this paper we discuss the shortest augmenting path method for solving assignment problems in the following respect: we introduce this basic concept using matching theory we present several efficient labeling techniques for constructing shortest augmenting paths we show the relationship of this approach to several classical assignment ...
U Derigs
openaire +3 more sources
In this paper we discuss the shortest augmenting path method for solving assignment problems in the following respect: we introduce this basic concept using matching theory we present several efficient labeling techniques for constructing shortest augmenting paths we show the relationship of this approach to several classical assignment ...
U Derigs
openaire +3 more sources
Estimating an origin-destination table using a method based on shortest augmenting paths
Transportation Research Part B: Methodological, 1994The most well-known origin-destination estimation methods involve entropy maximization or information minimization. However, these methods often require much more information than is available in reliable form, namely, target trip tables and the extent to which each origin-destination path uses each link. In this paper, a second version of the Shortest
Refat Barbour, Jon D. Fricker
openaire +3 more sources
A path generation method for path tracking algorithms that use the augmented reality
ICCAS 2010, 2010Nowadays, the research of the unmanned vehicle robots is increased, especially in the military fields. Some of these robots use path tracking algorithm, so the path generation method is needed. Now we suggest that the path generation method could be used into augmented reality using the B-spline curve equation. Therefore we can make the robot can track
Min-Ho Kim, Min-Cheol Lee
openaire +1 more source
Improved NC path validation and manipulation with augmented reality methods
Production Engineering, 2008Five-axis milling offers many advantages over the conventional three-axis milling process. However, because of the potentially complex motions, it is difficult for the machine tool operator to anticipate the actual movement based on the NC program. In this paper a software system for the NC path validation and manipulation during the milling process is
Klaus Weinert +3 more
openaire +1 more source
An interactive 3D movement path manipulation method in an augmented reality environment
Interacting with Computers, 2012In this paper, we evaluate a path editing method using a tangible user interface to generate and manipulate the movement path of a 3D object in an Augmented Reality (AR) scene. To generate the movement path, each translation point of a real 3D manipulation prop is examined to determine which point should be used as a control point for the path ...
Taejin Ha +2 more
openaire +2 more sources