Gendron, Bernard, 1966-
Gendron, B.
Gendron, Bernard 1966-2022
Gendron, Bernard (author of: Technology and the human condition)
Bernard Gendron Ph.D. Université de Montréal 1994
VIAF ID: 105308636 (Personal)
Permalink: http://viaf.org/viaf/105308636
Preferred Forms
- 100 0 _ ‡a Bernard Gendron ‡c Ph.D. Université de Montréal 1994
- 100 1 _ ‡a Gendron, B.
- 100 1 _ ‡a Gendron, Bernard ‡c (author of: Technology and the human condition)
-
- 100 1 _ ‡a Gendron, Bernard ‡d 1966-2022
-
-
4xx's: Alternate Name Forms (4)
5xx's: Related Names (2)
- 510 2 _ ‡a Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Université de Montréal ‡b Département d'informatique et de recherche opérationnelle ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Benders decomposition, branch-and-cut and hybrid algorithms for the minimum connected dominating set problem | |
Bounding procedures for multicommodity capacitated fixed charge network design problems | |
A branch-and-benders-cut method for nonlinear power design in green wireless local area networks | |
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem | |
Branch-and-price for personalized multi-activity tour scheduling | |
Characterization of a COVID-fired urban bike delivery system | |
A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems | |
A computational comparison of flow formulations for the capacitated location-routing problem | |
A decomposition algorithm for computing bounds on the clique number of a graph | |
Diversification strategies in local search for a nonbifurcated network loading problem | |
Dynamic facility location with generalized modular capacities | |
Formulations and exact solution approaches for the degree preserving spanning tree problem | |
A general variable neighborhood search heuristic for the traveling salesman problem with time windows under completion time minimization | |
Grammar-based integer programming models for multi-activity shift scheduling | |
A guide to parcel lockers in last mile distribution - highlighting challenges and opportunities from an OR perspective | |
Implantations parallèles d'un algorithme de séparation et évaluation progressive pour résoudre le problème de localisation avec équilibrage | |
A Lagrangian-based branch-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints | |
A load balancing procedure for parallel constraint programming | |
Modèles et algorithmes pour problèmes d'optimisation de réseaux avec coûts fixes | |
Modeling and solving a logging camp location problem | |
Models and methods for merge-in-transit operations | |
A multilayer variable neighborhood search method for a two-echelon adaptive location-distribution problem | |
Network design with applications to transportation and logistics | |
Nouvelles méthodes de résolution de problèmes de conception de réseaux et leur implantation en environnement parallèle | |
On a generalization of the Gallai-Roy-Vitaver theorem and mathematical programming models for the bandwidth coloring problem | |
On edge orienting methods for graph coloring | |
On the computational efficiency of subgradient methods : a case study in combinatorial optimization | |
Parallel branch-and-bound algorithms : survey and synthesis | |
Parallel performance measures revisited | |
Reformulations by discretization for piecewise linear integer multicommodity network flow problems | |
Revue des inǧalitš valides pertinentes aux problm̈es de conception de ršeaux | |
Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches | |
Service network design of bike sharing systems with resource constraints | |
A stabilized structured Dantzig-Wolfe decomposition method | |
A survey and taxonomy of multilayer network design | |
Total domination and the Caccetta-Häggkvist conjecture | |
Variable neighborhood descent for multicommodity location with balancing requirements |