设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(3)
SpringerLink电子期刊(222)
Elsevier电子期刊(185)
Springer电子图书(1)
ProQuest学位论文(6)
在“
SpringerLink电子期刊
”中,
命中:
222
条,耗时:0.0269871 秒
在所有数据库中总计命中:
417
条
1.
Knapsack problem with objective value gaps
作者:
Alexander Dolgui
;
Mikhail Y. Kovalyov
;
Alain Quilliot
关键词:
Knapsack problem
;
Computational complexity
;
Fully
polynomial
time
approximation
scheme
;
Forbidden values
刊名:Optimization Letters
出版年:2017
2.
Efficient
approximation
scheme
s for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
作者:
Imed Kacem
;
Hans Kellerer
;
Maryam Seifaddini
关键词:
Approximation
scheme
s
;
Scheduling
;
Maximum lateness
;
Single machine
;
Fixed operator Interval
;
Machine non
;
availability interval
刊名:Journal of Combinatorial Optimization
出版年:2016
3.
Fully
polynomial
-
time
approximation
scheme
for a special case of a quadratic Euclidean 2-clustering problem
作者:
A. V. Kel'manov
;
V. I. Khandeev
关键词:
cluster analysis
;
partition
;
Euclidean space
;
minimum of the sum of squares of distances
;
NP
;
hardness
;
fixed space dimension
;
FPTAS
刊名:Computational Mathematics and Mathematical Physics
出版年:2016
4.
A
Fully
Polynomial
-
Time
Approximation
Scheme
for a Special Case of a Balanced 2-Clustering Problem
关键词:
NP
;
hardness
;
Euclidian space
;
Fixed dimension
;
FPTAS
刊名:Lecture Notes in Computer Science
出版年:2016
5.
An Improved
Approximation
Scheme
for Variable-Sized Bin Packing
作者:
Klaus Jansen
;
Stefan Kraft
刊名:Theory of Computing Systems
出版年:2016
6.
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
作者:
Matúš Mihalák
;
Rastislav Šrámek
;
Peter Widmayer
关键词:
Shortest paths
;
Approximation
algorithms
;
Counting
刊名:Theory of Computing Systems
出版年:2016
7.
Discontinuous Galerkin
Approximation
of Linear Parabolic Problems with Dynamic Boundary Conditions
作者:
P. F. Antonietti
;
M. Grasselli
;
S. Stangalino
;
M. Verani
关键词:
Discontinuous Galerkin
;
Dynamic boundary conditions
;
Parabolic problems
;
Error estimates
刊名:Journal of Scientific Computing
出版年:2016
8.
New results on two-machine flow-shop scheduling with rejection
作者:
Liqi Zhang
;
Lingfa Lu
;
Shisheng Li
关键词:
Scheduling
;
Flow shop
;
Rejection penalty
;
NP
;
hard
;
On
;
line algorithm
刊名:Journal of Combinatorial Optimization
出版年:2016
9.
Common due date assignment and single-machine scheduling with release
time
s to minimize the weighted number of tardy jobs
作者:
Chuanli Zhao
关键词:
Scheduling
;
Single
;
machine
;
Release
time
;
Due date
;
90B35
刊名:Japan Journal of Industrial and Applied Mathematics
出版年:2016
10.
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
作者:
Ei Ando
;
Shuji Kijima
关键词:
Approximate convolution
;
Volume computation
;
#P
;
hard
;
Knapsack polytope
刊名:Algorithmica
出版年:2016
1
2
3
4
5
6
7
8
9
按检索点细分(222)
题名(13)
关键词(34)
文摘(213)
按出版年细分(222)
2017年(1)
2016年(16)
2015年(9)
2014年(30)
2013年(17)
2012年(24)
2011年(3)
2010年(9)
2009年(12)
2008年(11)
2007年(22)
2006年(23)
2005年(14)
2004年(13)
2003年(4)
2002年(8)
2001年(2)
2000年及以前(4)
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
.