设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(24)
Elsevier电子期刊(15)
在“
Elsevier电子期刊
”中,
命中:
15
条,耗时:小于0.01 秒
在所有数据库中总计命中:
39
条
1.
The Subset Sum game
作者:
Andreas Darmann
;
Gaia Nicosia
;
Ulrich
Pferschy
;
Joachim Schauer
关键词:
Subset Sum problem
;
Multi-agent optimization
;
Performance analysis
;
Game theory
刊名:European Journal of Operational Research
出版年:16 March, 2014
2.
Exact solution of the robust knapsack problem
作者:
Michele Monaci
;
Ulrich
Pferschy
;
Paolo Serafini
关键词:
Knapsack problem
;
Robust optimization
;
Dynamic programming
刊名:Computers and Operations Research
出版年:2013
3.
A note on maximizing the minimum voter satisfaction on spanning trees
作者:
Andreas Darmann
;
Christian Klamler
;
Ulrich
Pferschy
关键词:
Minimal spanning tree
;
Social choice
;
Fairness
刊名:Mathematical Social Sciences
出版年:2010
4.
Resource allocation with time intervals
作者:
Andreas Darmann
;
Ulrich
Pferschy
;
Joachim Schauer
关键词:
Resource allocation
;
Proper intervals
;
Interval scheduling
;
Unsplittable flow
刊名:Theoretical Computer Science
出版年:2010
5.
Maximizing the minimum voter satisfaction on spanning trees
作者:
Andreas Darmann
;
Christian Klamler
;
Ulrich
Pferschy
关键词:
Minimal spanning tree
;
Social choice
;
Fairness
刊名:Mathematical Social Sciences
出版年:2009
6.
Influence of production costs on cutting optimization in window frame production—A graph-theoretical model
作者:
Alex
;
er Johannes Petutschnigg
;
Ulrich
Pferschy
;
Lambert Sattler
关键词:
Wood scanning
;
Graph models
;
Wooden window production
;
Optimization
刊名:Computers and Electronics in Agriculture
出版年:2007
7.
Hans Kellerer,
Ulrich
Pferschy
and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp.,
€
99,95.
作者:
Strusevich
;
Vitaly
刊名:Operations Research Letters
出版年:2005
8.
Modified subset sum heuristics for bin packing
作者:
Alberto Caprara and
Ulrich
Pferschy
关键词:
Bin packing
;
Subset sum heuristic
;
Worst-case analysis
;
Analysis of algorithms
刊名:Information Processing Letters
出版年:2005
9.
Worst-case analysis of the subset sum algorithm for bin packing
作者:
Caprara
;
Alberto
;
Pferschy
;
Ulrich
关键词:
Bin packing
;
Subset sum heuristic
;
Worst-case analysis
刊名:Operations Research Letters
出版年:2004
10.
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
作者:
Kellerer
;
Hans
;
Mansini
;
Renata
;
Pferschy
;
Ulrich
;
Speranza
;
Maria Grazia
关键词:
Subset-sum problem
;
Worst-case performance
;
Fully polynomial approximation scheme
;
Knapsack problem
刊名:Journal of Computer and System Sciences
出版年:2003
1
2
按检索点细分(15)
题名(1)
作者(14)
按出版年细分(15)
2013年(1)
2010年(2)
2009年(1)
2007年(1)
2005年(2)
2004年(1)
2003年(1)
2000年(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
.