设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(9)
在“
SpringerLink电子期刊
”中,
命中:
9
条,耗时:0.0359812 秒
在所有数据库中总计命中:
9
条
1.
On the minimization of traffic congestion in road networks with tolls
作者:
F. Stefanello
;
L. S. Buriol
;
M. J. Hirsch
;
P. M. Pardalos…
关键词:
Combinatorial optimization
;
Transportation networks
;
Genetic algorithms
;
Tollbooth
problem
刊名:Annals of Operations Research
出版年:2017
2.
New Complexity Results and Algorithms for the Minimum
Tollbooth
Problem
刊名:Lecture Notes in Computer Science
出版年:2015
3.
Improved Hardness Results for Profit Maximization Pricing
Problem
s with Unlimited Supply
作者:
Parinya Chalermsook (20) (21)
Julia Chuzhoy (22)
Sampath Kannan (23)
Sanjeev Khanna (23)
刊名:Lecture Notes in Computer Science
出版年:2012
4.
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees
作者:
Marek Cygan (18)
Fabrizio Grandoni (18)
Stefano Leonardi (19)
Marcin Pilipczuk (20)
Piotr Sankowski (20)
刊名:Lecture Notes in Computer Science
出版年:2012
5.
On Profit-Maximizing Pricing for the Highway and
Tollbooth
Problem
s
作者:
Khaled Elbassioni
;
Rajiv Raman
;
Saurabh Ray
;
Ren¨¦ Sitters
刊名:Lecture Notes in Computer Science
出版年:2009
6.
Approximation Algorithms for Non-single-minded Profit-Maximization
Problem
s with Limited Supply
作者:
Khaled Elbassioni
;
Mahmoud Fouz
;
Chaitanya Swamy
刊名:Lecture Notes in Computer Science
出版年:2010
7.
How to Sell a Graph: Guidelines for Graph Retailers
作者:
Alexander Grigoriev
;
Joyce van Loon
;
René Sitters
;
Marc Uetz
关键词:
Pricing
problem
s
;
tollbooth
problem
;
highway
problem
;
computational complexity
;
dynamic programming
;
fully polynomial time approximation scheme
刊名:Lecture Notes in Computer Science
出版年:2006
8.
How to Sell a Graph: Guidelines for Graph Retailers
作者:
Alexander Grigoriev
;
Joyce van Loon
;
Ren¨¦ Sitters
;
Marc Uetz
关键词:
Pricing
problem
s
;
tollbooth
problem
;
highway
problem
;
computational complexity
;
dynamic programming
;
fully polynomial time approximation scheme
刊名:Lecture Notes in Computer Science
出版年:2006
9.
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
作者:
Ning Chen and Atri Rudra
关键词:
Walrasian equilibrium
;
Combinatorial auction
;
Single
;
minded auction
;
NP
;
hard
;
Approximation
刊名:Algorithmica
出版年:2008
1
按检索点细分(9)
题名(2)
关键词(3)
文摘(7)
按出版年细分(9)
2017年(1)
2015年(1)
2012年(2)
2010年(1)
2009年(1)
2008年(1)
2006年(2)
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
.