科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
J
José-Manuel Belenguer
University of Valencia
13
H指数
19
论文数
1.7K
被引数
0
相关解读
订阅
收录论文
10
发表时间
发表时间
IF
被引数
A branch-and-cut algorithm for a skip pick-up and delivery problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2024-08-01
0
OA
AI
Belenguer, Jose M.; Cubillos, Maximiliano; Wohlk, Sanne
分享
收藏
Models and algorithms for a yard crane scheduling problem in container ports
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2023-09-01
17
PRE
AI
Vallada, Eva; Belenguer, Jose Manuel; Villa, Fulgencia; Alvarez-Valdes, Ramon
分享
收藏
Optimizing the level of service quality of a bike-sharing system
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
IF
7.2
2016-07-01
172
PRE
AI
Alvarez-Valdes, Ramon; Belenguer, Jose M.; Benavent, Enrique; Bermudez, Jose D.; Munoz, Facundo; Vercher, Enriqueta; Verdejo, Francisco
分享
收藏
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
带有卫星仓库的单卡车和拖车路径问题的分支切割算法
TRANSPORTATION SCIENCE
IF
4.8
2016-05-01
33
PRE
AI
Belenguer, Jose Manuel; Benavent, Enrique; Martinez, Antonio; Prins, Christian; Prodhon, Caroline; Villegas, Juan G.
分享
收藏
A Branch-and-Cut method for the Capacitated Location-Routing Problem
一种求解带容量定位-路径问题的分支切割法
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2011-06-01
184
PRE
AI
Belenguer, Jose-Manuel; Benavent, Enrique; Prins, Christian; Prodhon, Caroline; Calvo, Roberto Wolfler
分享
收藏
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
TRANSPORTATION SCIENCE
IF
4.8
2010-05-01
32
PRE
AI
Belenguer, Jose-Manuel; Benavent, Enrique; Labadi, Nacima; Prins, Christian; Reghioui, Mohamed
分享
收藏
Lower and upper bounds for the mixed capacitated arc routing problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2006-12-01
95
PRE
AI
Belenguer, Jose-Manuel; Benavent, Enrique; Lacomme, Philippe; Prins, Christian
分享
收藏
RutaRep:: a computer package to design dispatching routes in the meat industry
JOURNAL OF FOOD ENGINEERING
IF
5.8
2005-10-01
18
PRE
AI
Belenguer, JM; Benavent, E; Martínez, MC
分享
收藏
A cutting plane algorithm for the capacitated arc routing problem
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2003-04-01
132
PRE
AI
Belenguer, JM; Benavent, E
分享
收藏
Separating capacity constraints in the CVRP using tabu search
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
1998-04-01
128
PRE
AI
Augerat, P; Belenguer, JM; Benavent, E; Corberan, A; Naddef, D
分享
收藏
研究方向
暂时未获取到该数据
合作学者
合作期刊
M
Maria Carmen Martínez
H 指数: 56 · 论文数: 352
C
Christian Prins
H 指数: 54 · 论文数: 333
R
Ramón Álvarez-Valdés
H 指数: 34 · 论文数: 72
R
Roberto Wolfler Calvo
H 指数: 31 · 论文数: 176
Á
Ángel Corberán
H 指数: 29 · 论文数: 84
查看更多