Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 66 de 155
It is now well known that in order to solve global environmental problems, such as global warming, a volunteer participation of sovereign countries to inte...
référence BibTeX
Soit \(G\)
un graphe connexe, \(n\)
l'ordre de \(G\)
, et \(f\)
(resp. \(t\)
)
l'ordre maximum d'une forêt induite (resp. d'un arbre induit) dans
`...
We propose an interior-point algorithm based on an elastic formulation of the \(\ell_1\)
-penalty merit function for mathematical programs with complementar...
We present a new primal-dual interior-point algorithm for linear programming problems with equality and inequality constraints. The inequality constraints ar...
référence BibTeX
Carbon leakage and competitiveness concerns are some of the main reasons why an international environmental agreement is lacking to fight climate change. M...
référence BibTeXA Review of Survival Trees
This paper presents a non--technical account of the developments in tree--based methods for the analysis of survival data with censoring. This review desc...
référence BibTeX
The decomposition of the movement of the eye into different categories is critical to their study. According to the algorithm used, some movements may signi...
référence BibTeX
In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...
référence BibTeX
There are currently several systems to collect online writing data in keystroke logging. Each of these systems provides reliable and very precise data. Unf...
référence BibTeX
An <i>r</i>-equitable <i>k</i>-coloring <i>c</i> of a graph <i>G=(V,E)</i> is a partition of <i>V</i> into <i>k</i> stable sets <img src="/cgi-bin/mimetex.cg...
référence BibTeXDegeneracy of Harmonic Means Clustering
It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....
référence BibTeX
Interior-point methods in augmented form for linear and convex quadratic programming require the solution of a sequence of symmetric indefinite linear ...
référence BibTeX
We study the welfare effects of Price Cap Regulation (PCR) and the strategic behaviour it may induce in gas transportation networks by analyzing a stylized g...
référence BibTeX
The asymmetric distance--constrained vehicle routing problem, consists of finding vehicle tours to connect all customers with a depot, such that the to...
référence BibTeX
We present a Variable Neighborhood Search approach to solving the one-commodity pickup-and-delivery travelling salesman problem. It is characterized by a s...
référence BibTeXMaximizing Edge-Ratio Is NP-Complete
Given a graph <i>G</i> and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divid...
référence BibTeX
Censored quantile regression models are very useful for the analysis of censored data when standard linear models are felt to be appropriate. However, fitt...
référence BibTeX
In this paper an effective modification to the original Nelder-Mead simplex method is suggested. It is shown that the new heuristic outperforms on average ...
référence BibTeXVariable Neighborhood Search for Metric Dimension and Minimal Doubly Resolving Set Problems
In this paper we consider two similar NP-hard optimization problems on graphs: the metric dimension problem and the problem of determining minimal doubly r...
référence BibTeX
Variable Neighborhood Search (VNS) has shown to be a powerful tool for solving both discrete and box-constrained continuous optimization problems. In this ...
référence BibTeX