设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
中国地质文献-英文(2)
SpringerLink电子期刊(1364)
GSW全文库(6)
Wiley电子期刊(13)
ProQuest学位论文(143)
Elsevier电子期刊(1105)
Springer电子图书(14)
NATURE电子期刊(2)
ACS电子期刊(4)
在“
Elsevier电子期刊
”中,
命中:
1,105
条,耗时:0.0909883 秒
在所有数据库中总计命中:
2,653
条
1.
Analysis of FPTASes for the multi-objective
shortest
path
problem
作者:
Thomas Breugem
;
breugem@ese.eur.nl
;
Twan Dollevoet
dollevoet@ese.eur.nl
;
Wilco van den Heuvel
wvandenheuvel@ese.eur.nl
关键词:
Shortest
path
problem
;
Multi-objective optimization
;
FPTAS
;
Complexity analysis
刊名:Computers & Operations Research
出版年:2017
2.
On the
Shortest
Path
Game
作者:
Andreas Darmann
a
;
andreas.darmann@uni-graz.at
;
Ulrich Pferschy
b
;
pferschy@uni-graz.at
;
Joachim Schauer
b
;
joachim.schauer@uni-graz.at
关键词:
Shortest
path
problem
;
Game theory
;
Computational complexity
;
Cactus graph
刊名:Discrete Applied Mathematics
出版年:2017
3.
Refreshment of the
shortest
path
cache with change of single edge
作者:
Xiaohua Li
a
;
lixiaohua@mail.neu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Tao Qiu
a
;
qiutaoneu@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Ning Wang
;
b
;
ningwang@shu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Xiaochun Yang
a
;
yangxc@mail.neu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Bin Wang
a
;
binwang@mail.neu.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Ge Yu
a
;
yuge@ise.neu.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Shortest
path
caching
;
Cache refreshment strategy
;
Change of road network
;
Affected
shortest
path
s
刊名:Expert Systems with Applications
出版年:2017
4.
Optimal construction of node-disjoint
shortest
path
s in folded hypercubes
作者:
Cheng-Nan Lai
cnlai@mail.nkmu.edu.tw
Author Vitae
关键词:
Folded hypercube
;
Node-disjoint
path
s
;
Maximum matching
;
Optimization
problem
刊名:Journal of Parallel and Distributed Computing
出版年:2017
5.
Simulation-based multi-objective model for supply chains with disruptions in transportation
作者:
Herná
;
n Chá
;
vez
a
;
Krystel K. Castillo-Villar
a
;
krystel.castillo@utsa.edu" class="auth_mail" title="E-mail the corresponding author
;
Luis Herrera
b
;
Agustí
;
n Bustos
c
关键词:
U.S.
;
United States
;
SC
;
Supply Chain
;
SMMCF
;
Stochastic Multi-Objective Minimum Cost Flow
;
SimMOpt
;
Simulation-Based Multi-Objective Optimization
;
MSPP
;
Multi-Objective
Shortest
Path
Problem
;
MMCF
;
Multi-Objective Minimum Cost Flow
;
MCF
;
Minimum Cost Flow
;
CPM
;
Cost Per Mile
;
SPP
;
Shortest
Path
Problem
;
SA
;
Simulated Annealing
;
TM
;
Trade Mark
;
NFL
;
No Free Lunch Theorem
;
BMCF
;
Bi-Objective Minimum Cost Flow
;
NP
;
Non-Deterministic Polynomial
;
DHS
;
Department of Homeland Security
;
Sched
;
Schedule
刊名:Robotics and Computer-Integrated Manufacturing
出版年:2017
6.
Airline crew pairing with fatigue: Modeling and analysis
作者:
Burak C. Yildiz
;
Fatma Gzara
;
Samir Elhedhli
;
elhedhli@uwaterloo.ca
关键词:
Crew pairing
;
Crew fatigue
;
Three process model of alertness
;
Column generation
;
Shortest
path
problem
with fatigue
刊名:Transportation Research Part C: Emerging Technologies
出版年:2017
7.
Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks
作者:
Omar Dib
a
;
b
;
omar.dib@irt-systemx.fr
;
omar.dib@utbm.fr
;
Marie-Ange Manier
b
;
marie-ange.manier@utbm.fr
;
Laurent Moalic
b
;
laurent.moalic@utbm.fr
;
Alexandre Caminada
b
;
alexandre.caminada@utbm.fr
关键词:
Routing
;
Road networks
;
Shortest
path
problem
;
Exact approaches
;
Dijkstra
;
Integer Programming
;
Meta-heuristics
;
Genetic Algorithm
;
VNS
;
Hybrid meta-heuristics
刊名:Computers & Operations Research
出版年:2017
8.
Complexity of rainbow vertex connectivity
problem
s for restricted graph classes
作者:
Juho Lauri
juho.lauri@tut.fi
关键词:
Rainbow connectivity
;
Computational complexity
刊名:Discrete Applied Mathematics
出版年:2017
9.
CAPRA: A contour-based accessible
path
routing algorithm
作者:
Mohammad Saiedur Rahaman
;
a
;
saiedur.rahaman@rmit.edu.au
;
Yi Mei
a
;
b
;
yi.mei@ecs.vuw.ac.nz
;
Margaret Hamilton
a
;
margaret.hamilton@rmit.edu.au
;
Flora D. Salim
a
;
flora.salim@rmit.edu.au
关键词:
Journey planning
;
Accessible
path
;
Route ranking
;
Path
routing
;
Multi-objective A* algorithm
刊名:Information Sciences
出版年:2017
10.
A linear programming based heuristic framework for min-max regret combinatorial optimization
problem
s with interval costs
作者:
Lucas Assunç
;
ã
;
o
;
a
;
lucas-assuncao@ufmg.br
;
lucas.suncao88@gmail.com
;
Thiago F. Noronha
b
;
tfn@dcc.ufmg.br
;
André
;
a Cynthia Santos
c
;
andrea.duhamel@utt.fr
;
Rafael Andrade
d
;
rca@lia.ufc.br
关键词:
Robust optimization
;
Matheuristics
;
Benders&rsquo
;
decomposition
刊名:Computers & Operations Research
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(1105)
题名(165)
关键词(157)
文摘(957)
按出版年细分(1105)
2027年及以后(48)
2017年(24)
2016年(78)
2015年(18)
2014年(6)
2013年(87)
2012年(77)
2011年(66)
2010年(69)
2009年(55)
2008年(70)
2007年(60)
2006年(51)
2005年(43)
2004年(47)
2003年(40)
2002年(32)
2001年(28)
2000年(35)
2000年及以前(171)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.