Result 1 to 20 of 103 total
Centdian computation in cactus graphs. (English)
J. Graph Algorithms Appl. 16, No. 2, 199-224 (2012).
1
A cooperative location game based on the 1-center location problem. (English)
Eur. J. Oper. Res. 214, No. 2, 317-330 (2011).
2
Centdian computation for sensor networks. (English)
Kratochvíl, Jan (ed.) et al., Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7‒11, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). Lecture Notes in Computer Science 6108, 187-198 (2010).
3
On the planar piecewise quadratic 1-center problem. (English)
Algorithmica 57, No. 2, 252-283 (2010).
4
Centdian computation for sensor networks (English)
TAMC, 187-198 (2010).
5
Minimax regret single-facility ordered median location problems on networks. (English)
INFORMS J. Comput. 21, No. 1, 77-87 (2009).
6
Minimax flow tree problems. (English)
Networks 54, No. 3, 117-129 (2009).
7
New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems. (English)
Oper. Res. Lett. 37, No. 5, 303-306 (2009).
8
Optimal algorithms for the path/tree-shaped facility location problems in trees. (English)
Algorithmica 55, No. 4, 601-618 (2009).
9
An optimal $O(n\log n)$ algorithm for finding an enclosing planar rectilinear annulus of minimum width. (English)
Oper. Res. Lett. 37, No. 3, 168-170 (2009).
10
Collection depots facility location problems in trees. (English)
Networks 53, No. 1, 50-62 (2009).
11
Optimal location with equitable loads. (English)
Ann. Oper. Res. 167, 307-325 (2009).
12
Aggregation error for location models: Survey and analysis. (English)
Ann. Oper. Res. 167, 171-208 (2009).
13
Optimal location with equitable loads. (English)
Ann. Oper. Res. 167, 307-325 (2009).
14
Aggregation error for location models: Survey and analysis. (English)
Ann. Oper. Res. 167, 171-208 (2009).
15
Improved algorithms for the multicut and multiflow problems in rooted trees. (English)
Top 16, No. 1, 114-125 (2008).
16
Center location problems on tree graphs with subtree-shaped customers. (English)
Discrete Appl. Math. 156, No. 15, 2890-2910 (2008).
17
Minimum $L_k$ path partitioning-an illustration of the Monge property. (English)
Oper. Res. Lett. 36, No. 1, 43-45 (2008).
18
The bi-criteria doubly weighted center-median path problem on a tree. (English)
Camacho Moreno, José Carlos (ed.) et al., Avances en matemática discreta en Andalucía. Cádiz: Servicio de Publicaciones, Universidad de Cádiz (ISBN 978-84-9828-133-0/pbk). 203-209 (2007).
19
New results on minimax regret single facility ordered median location problems on networks. (English)
Arge, Lars (ed.) et al., Algorithms ‒ ESA 2007. 15th annual European symposium, Eilat, Israel, October 8‒10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 230-240 (2007).
20
Result 1 to 20 of 103 total
Start
Contact
Print
General Help
