科言猫
学术研究的AI总结
首页
文献互助
订阅
我的收藏
科研工具
选题分析
论文总结
专利管理
未登录
返回
L
Luı́s Gouveia
Universidade de Lisboa
31
H指数
161
论文数
3.0K
被引数
0
相关解读
订阅
收录论文
52
发表时间
发表时间
IF
被引数
A matheuristic for the traveling salesman problem with positional consistency constraints
一个用于具有位置一致性约束的旅行商问题的元启发式算法
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
IF
2.9
2025-11-01
0
OA
AI
Gouveia, Luis; Paias, Ana; Ponte, Mafalda
分享
收藏
On Location-Routing formulations for the Hamiltonian p-Median Problem
关于Hamiltonian p-Median问题的选址-路径规划公式
European Journal of Operational Research
IF
6
2025-10-27
0
PRE
AI
Francisco Canas; Luís Gouveia
分享
收藏
Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
含最多p个回路的回路覆盖问题的配方与分支定界算法
European Journal of Operational Research
IF
6
2025-05-15
0
PRE
AI
Francisco Canas; Luís Gouveia
分享
收藏
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2024-07-01
1
OA
AI
Barbato, Michele; Gouveia, Luis
分享
收藏
The travelling salesman problem with positional consistency constraints: An application to healthcare services
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2023-08-01
4
PRE
AI
Gouveia, Luis; Paias, Ana; Ponte, Mafalda
分享
收藏
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm
TRANSPORTATION SCIENCE
IF
4.8
2023-03-01
3
OA
AI
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
分享
收藏
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons
用于多仓库路由问题的紧凑公式: 理论和计算比较
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2020-12-01
11
PRE
AI
Bektas, Tolga; Gouveia, Luis; Santos, Daniel
分享
收藏
Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem (vol 262, pg 908, 2017)
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2020-09-01
0
OA
AI
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario; Sadykov, Ruslan
分享
收藏
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm
重新审视哈密顿p-中值问题: 有向图的新公式和分支割算法
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-07-01
10
PRE
AI
Bektas, Tolga; Gouveia, Luis; Santos, Daniel
分享
收藏
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2019-03-01
10
OA
AI
Bektas, Tolga; Gouveia, Luis; Martinez-Sykora, Antonio; Salazar-Gonzalez, Juan-Jose
分享
收藏
Layered graph approaches for combinatorial optimization problems
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2019-02-01
24
OA
AI
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
分享
收藏
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2018-03-01
7
PRE
AI
Gouveia, Luis; Joyce-Moniz, Martim; Leitner, Markus
分享
收藏
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2017-11-01
24
PRE
AI
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
分享
收藏
Models for the piecewise linear unsplittable multicommodity flow problems
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2017-08-01
13
OA
AI
Fortz, Bernard; Gouveia, Luis; Joyce-Moniz, Martim
分享
收藏
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems
分段线性整数多商品网络流问题的离散化重构
TRANSPORTATION SCIENCE
IF
4.8
2017-05-01
11
PRE
AI
Gendron, Bernard; Gouveia, Luis
分享
收藏
Spanning trees with a constraint on the number of leaves. A new formulation
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2017-05-01
5
PRE
AI
Gouveia, Luis; Simonetti, Luidi
分享
收藏
Design of survivable networks with vulnerability constraints
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2017-04-01
11
OA
AI
Gouveia, Luis; Leitner, Markus
分享
收藏
On the hop-constrained survivable network design problem with reliable edges
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2015-12-01
19
OA
AI
Botton, Quentin; Fortz, Bernard; Gouveia, Luis
分享
收藏
Load-dependent and precedence-based models for pickup and delivery problems
COMPUTERS & OPERATIONS RESEARCH
IF
4.3
2015-11-01
32
PRE
AI
Gouveia, Luis; Ruthmair, Mario
分享
收藏
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF
6
2015-08-01
28
PRE
AI
Catanzaro, Daniele; Gouveia, Luis; Labbe, Martine
分享
收藏
研究方向
暂无研究方向
合作学者
合作期刊
S
Stefan Voß
H 指数: 61 · 论文数: 798
T
Tolga Bektaş
H 指数: 45 · 论文数: 177
M
Martine Labbé
H 指数: 44 · 论文数: 381
T
Thomas L. Magnanti
H 指数: 43 · 论文数: 147
J
Juan‐José Salazar‐González
H 指数: 40 · 论文数: 171
查看更多