首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
REDUCING SPACE REQUIREMENTS FOR SHORTEST-PATH PROBLEMS
被引:5
|
作者
:
MUNRO, JI
论文数:
0
引用数:
0
h-index:
0
MUNRO, JI
RAMIREZ, RJ
论文数:
0
引用数:
0
h-index:
0
RAMIREZ, RJ
机构
:
来源
:
OPERATIONS RESEARCH
|
1982年
/ 30卷
/ 05期
关键词
:
D O I
:
10.1287/opre.30.5.1009
中图分类号
:
C93 [管理学];
学科分类号
:
12 ;
1201 ;
1202 ;
120202 ;
摘要
:
7
引用
收藏
页码:1009 / 1013
页数:5
相关论文
共 50 条
[11]
SOLVING CONSTRAINED SHORTEST-PATH PROBLEMS IN A UNIFIED WAY
CHEN, YL
论文数:
0
引用数:
0
h-index:
0
CHEN, YL
CHIN, YH
论文数:
0
引用数:
0
h-index:
0
CHIN, YH
COMPUTING AND INFORMATION,
1989,
: 57
-
63
[12]
A Shortest-Path Tree Approach for Routing in Space Networks
De Jonckere, Olivier
论文数:
0
引用数:
0
h-index:
0
机构:
Tech Univ Dresden, D-01187 Dresden, Germany
Tech Univ Dresden, D-01187 Dresden, Germany
De Jonckere, Olivier
Fraire, Juan A.
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Nacl Cordoba, CONICET, RA-5000 Cordoba, Argentina
Saarland Univ, Saarland Informat Campus, Saarbrucken, Germany
Tech Univ Dresden, D-01187 Dresden, Germany
Fraire, Juan A.
CHINA COMMUNICATIONS,
2020,
17
(07)
: 52
-
66
[13]
SHORTEST-PATH MOTION
PAPADIMITRIOU, CH
论文数:
0
引用数:
0
h-index:
0
机构:
NATL TECH UNIV ATHENS, GR-147 ATHENS, GREECE
NATL TECH UNIV ATHENS, GR-147 ATHENS, GREECE
PAPADIMITRIOU, CH
LECTURE NOTES IN COMPUTER SCIENCE,
1986,
241
: 144
-
153
[14]
Randomized Shortest-Path Problems: Two Related Models
Saerens, Marco
论文数:
0
引用数:
0
h-index:
0
机构:
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Catholic Univ Louvain, Machine Learning Grp, B-1348 Louvain, Belgium
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Saerens, Marco
Achbany, Youssef
论文数:
0
引用数:
0
h-index:
0
机构:
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Catholic Univ Louvain, Machine Learning Grp, B-1348 Louvain, Belgium
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Achbany, Youssef
Fouss, Francois
论文数:
0
引用数:
0
h-index:
0
机构:
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Catholic Univ Louvain, Machine Learning Grp, B-1348 Louvain, Belgium
Fac Univ Catholiques Mons, Dept Management Sci, B-7000 Mons, Belgium
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Fouss, Francois
Yen, Luh
论文数:
0
引用数:
0
h-index:
0
机构:
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Catholic Univ Louvain, Machine Learning Grp, B-1348 Louvain, Belgium
Catholic Univ Louvain, Informat Syst Unit, B-1348 Louvain, Belgium
Yen, Luh
NEURAL COMPUTATION,
2009,
21
(08)
: 2363
-
2404
[15]
A HEURISTIC APPROACH TO HARD CONSTRAINED SHORTEST-PATH PROBLEMS
RIBEIRO, CC
论文数:
0
引用数:
0
h-index:
0
机构:
NATL CTR TELECOMMUN STUDIES,DEPT APPL MATH,F-92131 ISSY LES MOULINEA,FRANCE
NATL CTR TELECOMMUN STUDIES,DEPT APPL MATH,F-92131 ISSY LES MOULINEA,FRANCE
RIBEIRO, CC
MINOUX, M
论文数:
0
引用数:
0
h-index:
0
机构:
NATL CTR TELECOMMUN STUDIES,DEPT APPL MATH,F-92131 ISSY LES MOULINEA,FRANCE
NATL CTR TELECOMMUN STUDIES,DEPT APPL MATH,F-92131 ISSY LES MOULINEA,FRANCE
MINOUX, M
DISCRETE APPLIED MATHEMATICS,
1985,
10
(02)
: 125
-
137
[16]
PERFORMANCE OF SHORTEST-PATH ALGORITHMS IN NETWORK FLOW PROBLEMS
DIVOKY, JJ
论文数:
0
引用数:
0
h-index:
0
机构:
KENT STATE UNIV,GRAD SCH MANAGEMENT,KENT,OH 44242
KENT STATE UNIV,GRAD SCH MANAGEMENT,KENT,OH 44242
DIVOKY, JJ
HUNG, MS
论文数:
0
引用数:
0
h-index:
0
机构:
KENT STATE UNIV,GRAD SCH MANAGEMENT,KENT,OH 44242
KENT STATE UNIV,GRAD SCH MANAGEMENT,KENT,OH 44242
HUNG, MS
MANAGEMENT SCIENCE,
1990,
36
(06)
: 661
-
673
[17]
SHORTEST-PATH PROBLEMS WITH TIME WINDOWS ON NODES AND ARCS
SANCHO, NGF
论文数:
0
引用数:
0
h-index:
0
机构:
Department of Mathematics and Statistics, McGill University, Montreal, QC
SANCHO, NGF
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS,
1994,
186
(03)
: 643
-
648
[18]
A HIGHLY PARALLEL ALGORITHM FOR MULTISTAGE OPTIMIZATION PROBLEMS AND SHORTEST-PATH PROBLEMS
ANTONIO, JK
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV CALIF IRVINE,DEPT ELECT ENGN,IRVINE,CA 92717
ANTONIO, JK
TSAI, WK
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV CALIF IRVINE,DEPT ELECT ENGN,IRVINE,CA 92717
TSAI, WK
HUANG, GM
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV CALIF IRVINE,DEPT ELECT ENGN,IRVINE,CA 92717
HUANG, GM
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING,
1991,
12
(03)
: 213
-
222
[19]
Knapsack: Connectedness, Path, and Shortest-Path
论文数:
引用数:
h-index:
机构:
Dey, Palash
Kolay, Sudeshna
论文数:
0
引用数:
0
h-index:
0
机构:
Indian Inst Technol Kharagpur, Kharagpur, W Bengal, India
Indian Inst Technol Kharagpur, Kharagpur, W Bengal, India
Kolay, Sudeshna
Singh, Sipra
论文数:
0
引用数:
0
h-index:
0
机构:
Indian Inst Technol Kharagpur, Kharagpur, W Bengal, India
Indian Inst Technol Kharagpur, Kharagpur, W Bengal, India
Singh, Sipra
LATIN 2024: THEORETICAL INFORMATICS, PT II,
2024,
14579
: 162
-
176
[20]
A label correcting approach for solving bicriterion shortest-path problems
Skriver, AJV
论文数:
0
引用数:
0
h-index:
0
机构:
Aarhus Univ, Dept Operat Res, DK-8000 Aarhus C, Denmark
Aarhus Univ, Dept Operat Res, DK-8000 Aarhus C, Denmark
Skriver, AJV
Andersen, KA
论文数:
0
引用数:
0
h-index:
0
机构:
Aarhus Univ, Dept Operat Res, DK-8000 Aarhus C, Denmark
Aarhus Univ, Dept Operat Res, DK-8000 Aarhus C, Denmark
Andersen, KA
COMPUTERS & OPERATIONS RESEARCH,
2000,
27
(06)
: 507
-
524
←
1
2
3
4
5
→