Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this paper we present a heuristic algorithm for the well- known Unconstrained Quadratic 0–1 Programming Problem. The approach is based on combining solutions in a genetic paradigm and incorporates intensification algorithms used to improve solutions and ...
This paper deals with a new discrete event simulation modeling concept, calledqobj, which comes from two well- known paradigms:objects andqueuing networks. The first provides important conceptual tools for model organization, while the second one allows fo ...
This volume features twenty-one invited lectures presented at ismp97, the 16th International Symposium on Mathematical Programming, Lausanne EPFL. They reflect the unbroken vitality, creativity, and cross-disciplinarity that have characterized Mathematical ...
This paper treats a production planning problem in an aluminum manufacturing plant characterized by milling equipment subject to wear and replacement, furnaces with limited capacities and precedence rules and timing implied by temperatures and alloy types. ...
Colliding beams experiments High Energy Physics rely on solid state detectors to track the flight paths of charged elementary particles near their primary point of interaction. Reconstructing tracks in this region requires, per collision, a partitioning of ...
We propose a novel and poweful methodology for three- dimensional (3D) grain growth modelling in both the anisotropic and the locally inhomogeneous cases, thus significantly generalizing previous related two-dimensional work. The fundamental modelling stru ...
In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack ...
Given a set P of n points in the plane, we want to find a simple, not necessarily convex, pentagon Q with vertices in P of minimum area. We present an algorithm for solving this problem in time O(nT(n)) and space O(n) , where T(n) is the number of empty tr ...
An efficient implementation of Cundall's model on the Cray T3D massively parallel computer is presented. This model is used to simulate granular media where every grain is identified separately, generating very time-consuming simulations. First, we show a ...
The 3D Laguerre model for polycrystal normal grain growth is generalized to the anisotropic case. In the model, the specific grain boundary energy id determined by the misorientation of adjacent grains and the grain boundary mobility is assumed to be isotr ...
