Institution
HEC Montréal
Education•Montreal, Quebec, Canada•
About: HEC Montréal is a education organization based out in Montreal, Quebec, Canada. It is known for research contribution in the topics: Vehicle routing problem & Corporate governance. The organization has 1221 authors who have published 5708 publications receiving 196862 citations. The organization is also known as: Ecole des Hautes Etudes Commerciales de Montreal & HEC Montreal.
Topics: Vehicle routing problem, Corporate governance, Heuristic (computer science), Context (language use), Monetary policy
Papers published on a yearly basis
Papers
More filters
••
01 Jan 2005TL;DR: In this article, a didactic introduction to the use of column generation technique in linear and in particular in integer programming is given, and the relevant basic theory and more advanced ideas which help in solving large scale practical problems are discussed.
Abstract: We give a didactic introduction to the use of the column generation technique in linear and in particular in integer programming. We touch on both, the relevant basic theory and more advanced ideas which help in solving large scale practical problems. Our discussion includes embedding Dantzig-Wolfe decomposition and Lagrangian relaxation within a branch-and-bound framework, deriving natural branching and cutting rules by means of a so-called compact formulation, and understanding and influencing the behavior of the dual variables during column generation. Most concepts are illustrated via a small example. We close with a discussion of the classical cutting stock problem and some suggestions for further reading.
379 citations
••
TL;DR: In this paper, the authors take stock of the education preoccupations that animate research on entrepreneurship focusing on the context of higher education and provide a content-aware analysis of them.
Abstract: Our purpose in this article is to take stock of the education preoccupations that animate research on entrepreneurship focusing on the context of higher education. More specifically, we content-ana...
376 citations
••
TL;DR: Examination of user participation in information systems security risk management and its influence in the context of regulatory compliance via a multi-method study at the organizational level suggests that users may be an important resource to IS security by providing needed business knowledge that contributes to more effective security measures.
Abstract: This paper examines user participation in information systems security risk management and its influence in the context of regulatory compliance via a multi-method study at the organizational level. First, eleven informants across five organizations were interviewed to gain an understanding of the types of activities and security controls in which users participated as part of Sarbanes-Oxley compliance, along with associated outcomes. A research model was developed based on the findings of the qualitative study and extant user participation theories in the systems development literature. Analysis of the data collected in a questionnaire survey of 228 members of ISACA, a professional association specialized in information technology governance, audit, and security, supported the research model. The findings of the two studies converged and indicated that user participation contributed to improved security control performance through greater awareness, greater alignment between IS security risk management and the business environment, and improved control development. While the IS security literature often portrays users as the weak link in security, the current study suggests that users may be an important resource to IS security by providing needed business knowledge that contributes to more effective security measures. User participation is also a means to engage users in protecting sensitive information in their business processes.
374 citations
••
TL;DR: In the berth-allocation problem (BAP), the aim is to optimally schedule and assign ships to berthing areas along a quay to minimization of the total service time for all ships.
Abstract: In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete case works with a finite set of berthing points. In the continuous case ships can berth anywhere along the quay. Two formulations and a tabu search heuristic are presented for the discrete case. Only small instances can be solved optimally. For these sizes the heuristic always yields an optimal solution. For larger sizes it is always better than a truncated branch-and-bound applied to an exact formulation. A heuristic is also developed for the continuous case. Computational comparisons are performed with the first heuristic and with a simple constructive procedure.
363 citations
••
TL;DR: An adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP and shows that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.
363 citations
Authors
Showing all 1262 results
Name | H-index | Papers | Citations |
---|---|---|---|
Danny Miller | 133 | 512 | 71238 |
Gilbert Laporte | 128 | 730 | 62608 |
Michael Pollak | 114 | 663 | 57793 |
Yong Yu | 78 | 523 | 26956 |
Pierre Hansen | 78 | 575 | 32505 |
Jean-François Cordeau | 71 | 208 | 19310 |
Robert A. Jarrow | 65 | 356 | 24295 |
Jacques Desrosiers | 63 | 173 | 15926 |
François Soumis | 61 | 290 | 14272 |
Nenad Mladenović | 54 | 320 | 19182 |
Massimo Caccia | 52 | 389 | 16007 |
Guy Desaulniers | 51 | 242 | 8836 |
Ann Langley | 50 | 161 | 15675 |
Jean-Charles Chebat | 48 | 161 | 9062 |
Georges Dionne | 48 | 421 | 7838 |