Result 1 to 10 of 10 total
Enumerating $K$ best paths in length order in DAGs. (English)
Eur. J. Oper. Res. 221, No. 2, 308-316 (2012).
1
An efficient time and space $K$ point-to-point shortest simple paths algorithm. (English)
Appl. Math. Comput. 218, No. 20, 10244-10257 (2012).
2
On the $K$ shortest path trees problem. (English)
Eur. J. Oper. Res. 202, No. 3, 628-635 (2010).
3
An algorithm for ranking assignments using reoptimization. (English)
Comput. Oper. Res. 35, No. 11, 3714-3726 (2008).
4
A decision-theoretic approach to robust optimization in multivalued graphs. (English)
Ann. Oper. Res. 147, 317-341 (2006).
5
An algorithm for determining the $k$-best solutions of the one-dimensional knapsack problem. (English)
Pesqui. Oper. 20, No. 1, 117-134 (2000).
6
A note on $K$-best solutions to the Chinese postman problem. (English)
SIAM J. Optim. 3, No.4, 726-733 (1993).
7
On the construction of the set of $K$-best matchings and their use in solving constrained matching problems. (English)
Combinatorial optimization. New frontiers in theory and practice, Proc. NATO ASI, Ankara/Turkey 1990, NATO ASI Ser., Ser. F 82, 209-223 (1992).
8
An approach to postoptimality and sensitivity analysis of zero-one goal programs. (English)
Nav. Res. Logist. 35, No. 1, 73-84 (1988).
9
Ranking scalar products to improve bounds for the quadratic assignment problem. (English)
Eur. J. Oper. Res. 20, 363-372 (1985).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
