Cahiers du GERAD
Search
Chronological list
3083 results — page 114 of 155
We consider a case of the convex feasibility problem where the set is defined by an infinite number of certain strongly convex self-concordant inequalities....
BibTeX reference
One important challenge in nonparametric density and regression-function estimation is spatially inhomogeneous smoothness. This is often modelled by Besov-t...
BibTeX reference
We analyze an analytic center cutting plane algorithm for the convex feasibility problems with semidefinite cuts. At each iteration the oracle returns a ...
BibTeX reference
The standard way to solve the static economic dispatch problem with transmission losses is the penalty factor method. The problem is solved iteratively by a...
BibTeX reference
In several arc routing problems, it is necessary to take turn penalties into account when designing a solution. Traditionally, this is done through a trans...
BibTeX reference
There is an increasing interest for efficient synthesis methods (routing and dimensioning) of large and robust multi-service networks. In the case of ATM ne...
BibTeX reference
Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and glo...
BibTeX reference
In this paper we propose a framework for the overall design problem of internet protocol (IP) networks with performance guarantees that includes the locatio...
BibTeX reference
This paper examines dynamic advertising and promotion strategies in a marketing channel where the retailer promotes the manufacturer's product, and the manu...
BibTeX reference
The aim of this paper is to provide a concise portrayal of medical applications of a new fuzzy classification method called PROAFTN, which uses a multicrite...
BibTeX reference
Weber's problem is to locate a facility in the Euclidean plane in order to minimize total transportation costs from that facility to a given set of users wi...
BibTeX referenceThe VRP with Pickup and Delivery
This paper presents a survey on the <i>Vehicle Routing Problem with Pickup and Delivery</i> in which a heterogeneous vehicle fleet based at multiple termina...
BibTeX reference
A model for the optimal location of new facilities in a competitive market is introduced under the hypothesis that customers' behavior can be modeled by ran...
BibTeX referenceThe VRP with Time Windows
This paper presents a survey of the research on the Vehicle Routing Problem with Time Windows (VRPTW), an extension of the Capacitated Vehicle Routing Probl...
BibTeX reference
This paper presents a mixed 0-1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new...
BibTeX reference
We propose an overall reconstruction of the traditional genetic algorithm method so that its inherent weaknesses such as slow convergence can be overcome. ...
BibTeX reference
Logistics and transportation decision support systems rely on models of travel distance for evaluating scenarios and estimating costs. This paper presents a...
BibTeX reference
We consider the problem of determining a set of optimal tolls on the arcs of a multicommodity transportation network. The problem is formulated as a bilevel...
BibTeX reference
This article examines arc routing problems from the "dual" perspective of node routing. It first attempts to explain why and how an arc routing problem shou...
BibTeX reference
We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is de...
BibTeX reference