设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(1)
Springer电子图书(1)
SpringerLink电子期刊(7)
Elsevier电子期刊(4)
在“
Elsevier电子期刊
”中,
命中:
4
条,耗时:小于0.01 秒
在所有数据库中总计命中:
13
条
1.
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
作者:
Bernard
Fortz
a
;
bernard
.
fortz
@ulb.ac.be" class="auth_mail" title="E-mail the corresponding author
;
Olga Oliveira
b
;
olga.oliveira@ua.pt" class="auth_mail" title="E-mail the corresponding author
;
Cristina Requejo
;
b
;
crequejo@ua.pt" class="auth_mail" title="E-mail the corresponding author
关键词:
Mixed integer linear programming
;
Tree realization
;
Topology discovery
;
Routing topology inference
;
Minimum evolution problem
刊名:European Journal of Operational Research
出版年:2017
2.
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs
作者:
Bernard
Fortz
1
;
b
fortz
@ulb.ac.be
;
Martine Labbé
;
mlabbe@ulb.ac.be
;
Alessia Violin
aviolin@ulb.ac.be
关键词:
Combinatorial Optimization
;
Bilevel Programming
;
Pricing
;
Networks
;
Dantzig-Wolfe
刊名:Electronic Notes in Discrete Mathematics
出版年:2013
3.
Easy distributions for combinatorial optimization problems with probabilistic constraints
作者:
Bernard
Fortz
;
Michael Poss
关键词:
Stochastic programming
;
Combinatorial optimization
;
Probabilistic constraint
刊名:Operations Research Letters
出版年:2010
4.
A tabu search algorithm for self-healing ring network design
作者:
Fortz
;
Bernard
;
Soriano
;
Patrick
;
Wynants
;
Christelle
关键词:
Telecommunications
;
Network design
;
Survivability
;
Self-healing rings
;
Tabu search
刊名:European Journal of Operational Research
出版年:2003
1
按检索点细分(4)
作者(4)
按出版年细分(4)
2017年(1)
2013年(1)
2010年(1)
2003年(1)
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
.