Axe 2 : Aide à la décision prise dans les systèmes complexes
RetourCahiers du GERAD
1415 résultats — page 37 de 71
A mixed interior/exterior-point method for nonlinear programming is described, that handles constraints by way of an <i>l</i><sub>1</sub>-penalty function. A...
référence BibTeX
The paper answers the three distinct questions of maximizing the perimeter, diameter and area of equilateral unit-width convex polygons. The solution to each...
référence BibTeX
NOMAD is software that implements the MADS algorithm (Mesh Adaptive Direct Search) for black-box optimization under general nonlinear constraints. Black-box ...
référence BibTeX
Traditionally, IP Network planning and design is mostly based on average delay or loss constraints which can often be easily calculated. Jitter, on the othe...
référence BibTeX
This paper develops a dynamic model to determine a firm's optimal risk management strategy when it faces uncertainty about its future profitability and inves...
référence BibTeX
An automatic method for constructing linear relaxations of constrained global optimization problems is proposed. Such a construction is based on affine and i...
référence BibTeXIntegrated Airline Crew Scheduling: A Bi-Dynamic Constraint Aggregation Method using Neighborhoods
The integrated crew scheduling (ICS) problem consists of determining, for a set of available crew members, least-cost schedules that cover all flights and re...
référence BibTeX
The multi-activity assignment problem consists of assigning interruptible activities to given work shifts so as to match as much as possible for each activit...
référence BibTeX
The purpose of this paper is to present and solve a new, important planning problem faced by many shipping companies dealing with the transport of bulk produ...
référence BibTeX
The vehicle routing problem with time windows VRPTW consists of finding least-cost vehicle routes to service given customers exactly once each while satisfyi...
référence BibTeX
A positive basis is a minimal set of vectors whose nonnegative linear combinations span the entire space R<i><sup>n</sup></i>. Interest in positive bases wa...
référence BibTeX
Climate change is one of the greatest challenges facing our planet in the foreseeable future and despite the urgency of the situation global GHG emissions ...
référence BibTeX
In this paper we establish the definition of the <i>set of ε-proper equilibria</i> of a bimatrix game. We define a 0-1 mixed quadratic program to ge...
référence BibTeX
Dans cet article, on raconte l'histoire de l'équipe GENCOL et du logiciel d'optimisation du même nom. C'est avant tout le récit d'une collaboration qui se po...
référence BibTeX
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
référence BibTeX
The main goal of this paper is to bring a contribution in order to facilitate automatic refinement of Bimatrix Game Nash extreme equilibria. We show how maxi...
référence BibTeX
We introduce the OPAL framework in which the identification of good algorithmic parameters is interpreted as a black box optimization problem whose variables...
référence BibTeX
Recent advances in coupling novel optimization methods to large-scale computing problems have opened the door to tackling a diverse set of physically realist...
référence BibTeX
In several companies such as large retail stores, the employees perform different activities (e.g., cashier or clerk in a specific department) to respond to ...
référence BibTeXA Note on Diameters of Point Sets
Relationships between the diameter of a set of <i>n</i> points in the plane at mutual distance at least one, the diameter of an equilateral <i>n</i>-gon and ...
référence BibTeX