HEC Montréal

About: HEC Montréal is a education organization based out in Montreal, Quebec, Canada. It is known for research contribution in the topics: Context (language use) & Vehicle routing problem. 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.

The Porter Hypothesis at 20: Can Environmental Regulation Enhance Innovation and Competitiveness?

Abstract: Twenty years ago, Harvard Business School economist and strategy professor Michael Porter stood conventional wisdom about the impact of environmental regulation on business on its head by declaring that well-designed regulation could actually enhance competitiveness. The traditional view of environmental regulation held by virtually all economists until that time was that requiring firms to reduce an externality like pollution necessarily restricted their options and thus by definition reduced their profits. After all, if profitable opportunities existed to reduce pollution, profit-maximizing firms would already be taking advantage of those opportunities. Over the past 20 years, much has been written about what has since become known simply as the Porter Hypothesis (PH). Yet even today, we find conflicting evidence and alternative theories that might explain the PH, and oftentimes a misunderstanding of what the PH does and does not say. This paper provides an overview of the key theoretical and empirical insights into the PH to date, draws policy implications from these insights, and sketches out major research themes going forward.

Fifty Years of Vehicle Routing

Abstract: The Vehicle Routing Problem (VRP) was introduced 50 years ago by Dantzig and Ramser under the title “The Truck Dispatching Problem.” The study of the VRP has given rise to major developments in the fields of exact algorithms and heuristics. In particular, highly sophisticated exact mathematical programming decomposition algorithms and powerful metaheuristics for the VRP have been put forward in recent years. The purpose of this article is to provide a brief account of this development.

NP-hardness of Euclidean sum-of-squares clustering

Abstract: A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al. (Mach. Learn. 56:9---33, 2004), is not valid. An alternate short proof is provided.

The dial-a-ride problem: models and algorithms

Abstract: The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for n users who specify pickup and delivery requests between origins and destinations. The aim is to plan a set of m minimum cost vehicle routes capable of accommodating as many users as possible, under a set of constraints. The most common example arises in door-to-door transportation for elderly or disabled people. The purpose of this article is to review the scientific literature on the DARP. The main features of the problem are described and a summary of the most important models and algorithms is provided.