Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Matthias Jager
Zhenxing Li
L.-Q. Xu
Jhonathan Pinzon
Liangliang Shang
Giovanni Venturelli
Chen Ma
Jing-Sheng Wong
Radu Timofte
Home
/
Author
/
BERNARD GENDRON
Author Info
Open Visualization
Name
Affiliation
Papers
BERNARD GENDRON
Centre interuniversitaire de recherche sur les réseaux d'Entreprise, la logistique et le transport, Université de Montréal, Montreal, Canada H3C 3J7
77
Collaborators
Citations
PageRank
90
688
49.92
Referers
Referees
References
1063
986
959
Search Limit
100
1000
Publications (77 rows)
Collaborators (90 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements
0
0.34
2022
A taxonomy of multilayer network design and a survey of transportation and telecommunication applications
0
0.34
2022
An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model
0
0.34
2022
A Lagrangian decomposition scheme for choice-based optimization
0
0.34
2022
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes
0
0.34
2020
The selective traveling salesman problem with draft limits
0
0.34
2020
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design.
0
0.34
2020
Integrating Resource Management in Service Network Design for Bike-Sharing Systems
0
0.34
2020
Dynamic and Stochastic Rematching for Ridesharing Systems - Formulations and Reductions.
0
0.34
2020
Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel.
1
0.36
2020
Revisiting Lagrangian relaxation for network design
0
0.34
2019
The -arborescence star problem: Formulations and exact solution approaches.
0
0.34
2019
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.
0
0.34
2019
Combining Benders decomposition and column generation for multi-activity tour scheduling.
0
0.34
2018
Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design.
0
0.34
2018
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design.
0
0.34
2018
Dynamic smoothness parameter for fast gradient methods.
1
0.34
2018
A general variable neighborhood search variants for the travelling salesman problem with draft limits
1
0.35
2017
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems.
2
0.36
2017
Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints.
2
0.36
2017
Energy Efficiency And Traffic Offloading In Wireless Mesh Networks With Delay Bounds
2
0.38
2017
A two-stage stochastic programming approach for multi-activity tour scheduling.
2
0.37
2017
Real-time management of transportation disruptions in forestry.
0
0.34
2017
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds.
3
0.41
2017
A general variable neighborhood search for the swap-body vehicle routing problem.
7
0.44
2017
Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design.
7
0.46
2017
Lagrangian Heuristics For Large-Scale Dynamic Facility Location With Generalized Modular Capacities
3
0.38
2017
Branch-and-Price for Personalized Multiactivity Tour Scheduling
4
0.46
2016
Strategic planning problem represented by a three-echelon logistics network-modeling and solving
0
0.34
2016
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks.
12
0.56
2016
Solving a dynamic facility location problem with partial closing and reopening
6
0.44
2016
Grammar-Based Integer Programming Models and Methods for Employee Scheduling Problems.
0
0.34
2016
Service Network Design of Bike Sharing Systems with Resource Constraints.
2
0.37
2016
Generalization of capacitated p-median location problem: Modeling and resolution
1
0.37
2016
Formulations and exact solution approaches for the degree preserving spanning tree problem
0
0.34
2015
Modeling and solving a logging camp location problem
6
0.44
2015
Dynamic Facility Location with Generalized Modular Capacities
10
0.62
2015
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
9
0.98
2014
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
23
0.99
2014
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
33
0.89
2014
The greening potential of content delivery in residential community networks.
3
0.40
2014
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem
17
0.59
2014
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
1
0.36
2014
A stabilized structured Dantzig-Wolfe decomposition method.
15
0.66
2013
Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks.
4
0.44
2013
The Degree Preserving Spanning Tree Problem: Valid Inequalities and Branch-and-cut method.
2
0.38
2013
A computational comparison of flow formulations for the capacitated location-routing problem.
15
0.64
2013
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
14
0.67
2013
Total domination and the Caccetta-Häggkvist conjecture.
1
0.36
2012
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
19
0.78
2011
1
2
50 / page
