Axis 1: Data valuation for decision making

Back

Cahiers du GERAD

413 results — page 20 of 21

, , and

We study empirically the topology of the local minima of the 3-SAT problem. In particular, we analyze the size of the plateaus, their altitude, their attrac...

BibTeX reference
, , and

We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...

BibTeX reference
, , , and

If it is assumed that the final product of bromination of C<sub>60</sub> will obey two rules, (i) that no two <i>sp</i><sup>3</sup> carbons may be adjacent,...

BibTeX reference

A new algorithm, which exploits information from both ends of the network, is presented for the bicriterion shortest path problem. The algorithm extends eff...

BibTeX reference
, , and

A new algorithm, based on interval analysis, is proposed for global optimization of constrained nonlinear nonconvex functions of several variables. It expl...

BibTeX reference
and

Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...

BibTeX reference
, , , , and

Chopping a graph <i>G</i> means removing one edge from each connected component of <i>G</i> in parallel, and repeating this until no edges remain. The requi...

BibTeX reference
, , , and

This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a fl...

BibTeX reference
G-97-01
Nesticity
and

A hypergraph <i>H=(X,E)</i> is <i>nested</i> if its edges are pairwise disjoint or included one into the other. The <i>nesticity</i> of <i>H</i> is defined...

BibTeX reference

Given a set of entities, Cluster Analysis aims at finding subsets, called clusters, which are homogeneous and/or well separated. As many types of clusterin...

BibTeX reference
, , , and

We study both the continuous and discrete problems of maximizing the product of two linear functions subject to all variables being between 0 and~1. We fir...

BibTeX reference
, , , and

It is shown that the anytime deduction procedure for probabilistic entailment of Frisch and Haddawy does not have the correctness property when the probabil...

BibTeX reference

A review is made of models and algorithms for probabilistic satisfiability and its extensions. The basic probabilistic satisfiability problem, in decision f...

BibTeX reference
and

Extension of input-output functions for generating units allows simultaneous solution of the static unit commitment and economic dispatch problems by dynami...

BibTeX reference
, , and

A mixed graph <i>G<sub><img src="theta.gif"></sub></i> contains both undirected edges and directed arcs. A <i>k</i>-coloring of <i>G<sub><img src="theta.g...

BibTeX reference
and

The <i>p</i>-maxisum dispersion problem consists of locating <i>p</i> facilities at vertices of a network in order to maximize the sum of the distances betw...

BibTeX reference
, , and

Splitting a tree is defined as removing all edges of a chain and disconnecting one from the other edges incident with that chain. Splitting a forest is simu...

BibTeX reference

Cluster Analysis is at the crossroad of many disciplines, and has numerous and diverse methods and applications. Mathematical Programming (together with gra...

BibTeX reference
, , and

Consider an assignment problem in which persons are qualified for some but usually not all of the jobs. Moreover, assume persons belong to given seniority c...

BibTeX reference

Global optimization methods aim at finding the global optimum of a nonlinear and nonconvex function subject to nonlinear and nonconvex constraints. The main...

BibTeX reference