Labb Martine

Martine Labb

Information about the author Martine Labb will soon be added to the site.
Found 45 papers in total
Locations on time-varying networks
1999
We begin by examining the dynamic behavior of a facility location such as a 1-median...
On generalized minimum spanning trees
2001
The generalized minimum spanning tree problem consists of designing a minimum cost...
Solving the two-connected network with bounded meshes problem
2000
We study the problem of designing at minimum cost a two-connected network such that...
The uncapacitated facility location problem with client matching
2000
The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension...
Complexity of spanning tree problems with leaf-dependent objectives
1996
We consider the problem of finding an optimal spanning tree with respect to objective...
Finding disjoint routes in telecommunications networks with two technologies
1999
We consider networks in which a cost is associated with each arc or edge and a...
A bilevel model of taxation and its application to optimal highway pricing
1998
We consider a bilevel model where the leader wants to maximize revenues from a...
Covering a graph with cycles
1998
This article describes a lower bounding procedure and heuristics for the Cycle Cover...
On the two-level uncapacitated facility location problem
1996
The authors study the two-level uncapacitated facility location (TUFL) problem. Given...
An exact algorithm for the dual bin packing problem
1995
In the Dual Bin Packing Problem (DBP), there is an unlimited number of bins of...
Approximation algorithms for the capacitated plant allocation problem
1994
This paper considers the following optimization problem: Given positive interegs and...
Improved algorithms for machine allocation in manufacturing systems
1994
In this paper the authors present two algorithms for a machine allocation problem...
The Median Location Problem with continuous demand
1992
The Continuous Median Location Problem considered here consists in finding the...
Market and locational equilibrium for two competitors
1991
The authors consider a two-stage location and allocation game involving two...
Sensitivity analysis in minisum facility location problems
1991
This paper considers tradeoffs between cost and perturbations of the weights in a...
Capacitated vehicle routing on trees
1991
T=(V,E) is a tree with nonnegative weights associated with each of its vertices. A...
Commuters’ paths with penalties for early or late arrival time
1990
The authors formulate the choice of a best path for a commuter leaving his/her home at...
The continuous center set of a network
1991
The continuous radius of a network N is the minimum for all points of N (i.e.,...
Competitive location with random utilities
1989
This paper studies m firms competing on location over a finite subset of vertices of a...
Sensitivity analysis in multiple objective linear programming: The tolerance approach
1989
The authors consider a multiple objective linear program solved by the weighted-sum...
Algorithms for voting and competitive location on a network
1988
Consider a network with weights associated to its vertices. When a facility must be...
Papers per page: