다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
European journal of operational research, v.182 no.2, 2007년, pp.561 - 577
Conde, Eduardo (Department of Statistic and Operations Research, Facultad de Matemá) , Candia, Alfredo (ticas, Universidad de Sevilla, Campus Universitario de Reina Mercedes, 41012 Sevilla, Spain)
AI-Helper
AbstractThe paper considers a classical optimization problem on a network whose arc costs are partially known. It is assumed that an interval estimate is given for each arc cost and no further information about the statistical distribution of the truth value of the arc cost is known. In this context...
Adler 203 2001 Data Compression Conference DCC’01 Towards compressing web graphs
Annals of Operations Research Alonso-Ayuso 124 111 2003 10.1023/B:ANOR.0000004765.69773.41 On dual based lower bounds for the sequential ordering problem with precedences and due dates
Operations Research Letters Aron 32 1 136 2003 On the complexity of the robust spanning tree with interval data
I. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI), August 2002.
Mathematical Programming Averbakh 90 263 2001 10.1007/PL00011424 On the complexity of a class of combinatorial optimization problems with uncertainty
Discrete Applied Mathematics Averbakh 127 505 2003 10.1016/S0166-218X(02)00384-0 Complexity of robust single facility location problems on networks with uncertain edge lengths
Discrete Applied Mathematics Averbakh 138 289 2004 10.1016/S0166-218X(03)00462-1 Interval data minmax regret network optimization problems
10.1145/984622.984652 P. Basu, J. Redi, Effect of overhearing transmissions on energy efficiency in dense sensor networks, in: IPSN’04, ACM, April 26-27, 2004.
Networks Beasley 19 1 1 1989 10.1002/net.3230190102 An SST-based algorithm for the Steiner problem in graphs
Bertsekas 1987 Data Networks
Journal of Mathematical Economics Branzei 39 39 2003 10.1016/S0304-4068(02)00082-4 Supermodular games and potential games
Networks Camerini 9 2 309 1978 A note on finding optimum branchings
Science Sinica Chu 14 1396 1965 On the shortest arborescence of a directed graph
Mathematical Programming Conde 100 2 345 2004 10.1007/s10107-003-0474-7 An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion
Journal of Research National Bureau of Standards Edmonds 71B 233 1967 10.6028/jres.071B.032 Optimum branching
Mathematical Programming Fischetti 53 173 1992 10.1007/BF01585701 An additive bounding procedure for the asymmetric travelling salesman problem
ORSA Journal on Computing Fischetti 5 4 426 1993 10.1287/ijoc.5.4.426 An efficient algorithm for the min-sum arborescence problem in complete digraphs
Combinatoria Gabow 6 2 109 1986 10.1007/BF02579168 Efficient algorithms for finding minimum spanning trees in undirected graphs
Networks Gavish 12 355 1982 10.1002/net.3230120402 Topological design of centralized computer networks: Formulations and algorithms
Gondran 1984 Graphs and Algorithms
R. Guerin, A. Orda, QoS routing in networks with inaccurate information: Theory and algorithms, in: IEEE INFOCOM’97, Kobe, Japan, 1997, pp. 75-83.
Machine Learning Heckerman 20 197 1995 10.1007/BF00994016 Learning bayesian networks: The combination of knowledge and statistical data
Information Processing Letters Kasperski 97 177 2006 10.1016/j.ipl.2005.11.001 An approximation algorithm for interval data minmax regret combinatorial optimization problems
10.1109/HICSS.2003.1174186 R. Kawatra, A hop constrained min-sum arborescence with outage costs, in: Proceedings of the 36th Hawai International Conference on Systems Sciences IEEE, HICSS’03, 2002.
Algorithmica Kececioglu 13 1-2 7 1995 10.1007/BF01188580 Combinatorial algorithms for DNA sequence assembly
Annals of Physics and Chemistry Kirchoff 72 497 1847 10.1002/andp.18471481202 Uber die auflosung der gleichungen, auf welche man bei der untersuchung der linearen verteilung galvanischer strome gefuhrt wird
Kouvelis 1997 10.1007/978-1-4757-2620-6 Robust Discrete Optimization and Its Applications
Proceedings of the American Mathematical Society Kruskal 7 48 1956 10.1090/S0002-9939-1956-0078686-7 On the shortest spanning tree of a graph and the traveling salesman problem
Larson 1981 Urban Operations Research
IEEE/ACM Transactions on Networking Lorenz 6 768 1998 10.1109/90.748088 QoS routing in networks with uncertain parameters
European Journal of Operational Research Montemanni 174 3 1479 2006 10.1016/j.ejor.2005.02.060 A Benders decomposition approach for the robust spanning tree problem with interval data
European Journal of Operational Research Montemanni 161 3 771 2005 10.1016/j.ejor.2003.10.008 A branch and bound algorithm for the robust spanning tree problem with interval data
MONET Papadimitriou 9 6 567 2004 Energy-aware broadcasting in wireless networks
Evolutionary Computation Pelikan 8 3 311 2000 10.1162/106365600750078808 Linkage problem, distribution estimation and bayesian networks
Bell System Technology Journal Prim 36 1389 1957 10.1002/j.1538-7305.1957.tb01515.x Shortest connection networks and some generalizations
Networks Ribeiro 36 138 2000 10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U Tabu search for the Steiner problem in graphs
Networks Tarjan 7 25 1977 10.1002/net.3230070103 Finding optimum branchings
IEEE Transactions on Computers Tate 46 4 477 1997 10.1109/12.588062 Band ordering in lossless compression if multispectral images
IEEE/ACM Transactions on Networking Wan 12 3 507 2004 10.1109/TNET.2004.828940 Minimum-power multicast routing in static ad hoc networks
Operations Research Letters Yaman 29 1 31 2001 10.1016/S0167-6377(01)00078-5 The robust spanning tree problem with interval data
European Journal of Operational Research Zielinski 158 3 570 2004 10.1016/S0377-2217(03)00373-4 The computational complexity of the relative robust spanning tree problem with interval data
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.