Result 1 to 13 of 13 total
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation. (English)
Algorithmica 36, No.4, 331-341 (2003).
1
A heuristic for Dijkstra’s algorithm with many targets and its use in weighted matching algorithms. (English)
Algorithmica 36, No. 1, 75-88 (2003).
2
$n$-Tokyoites’ loop-line commuter problem. (English)
Discrete Math. 269, No.1-3, 81-91 (2003).
3
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation. (English)
Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17‒19, 1999. Philadelphia, PA: SIAM. 476-483 (1999).
4
A note on the weighted matching with penalty problem. (English)
Pattern Recognit. Lett. 19, No.3-4, 261-263 (1998).
5
Linear and time minimum-cost matching algorithms for quasi-convex tours. (English)
SIAM J. Comput. 27, No.1, 170-201 (1998).
6
Valuated matroid intersection. I: Optimality criteria. (English)
SIAM J. Discrete Math. 9, No.4, 545-561 (1996).
7
On-line algorithms for weighted bipartite matching and stable marriages. (English)
Theor. Comput. Sci. 127, No. 2, 255-267 (1994).
8
A solution algorithm with sensitivity analysis for optimal matchings and related problems. (English)
Congr. Numerantium 102, 193-230 (1994).
9
The invisible hand algorithm: solving the assignment problem with statistical physics. (English)
Neural Netw. 7, No.3, 477-490 (1994).
10
The probabilistic analysis of a heuristic for the assignment problem. (English)
SIAM J. Comput. 17, No.4, 732-741 (1988).
11
A decomposition algorithm for linear relaxation of the weigted r-covering problem. (English)
Math. Program. 31, 67-77 (1985).
12
An analysis of alternate strategies for implementing matching algorithms. (English)
Rep., Inst. Ökon. Oper. Res., Rheinische Friedrich-Wilhelms-Univ., Bonn 82226-OR, 50 p. (1982).
13
Result 1 to 13 of 13 total
Start
Contact
Print
General Help
