Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Collette R. Coullard"'
Publikováno v:
Transportation Science. 43:455-472
In this paper we consider a centralized logistics system in which a single company owns the production facility and the set of retailers and establishes warehouses that will replenish the retailers' inventories. We analyze the potential savings that
Publikováno v:
Naval Research Logistics. 55:295-312
In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which
Publikováno v:
Transportation Science. 41:29-43
An important aspect of designing a distribution system is determining the locations of the facilities. For systems in which deliveries are made along multiple stop routes, the routing problem and location problem must be considered simultaneously. In
Publikováno v:
Transportation Science. 37:40-55
We consider a joint location-inventory problem involving a single supplier and multiple retailers. Associated with each retailer is some variable demand. Due to this variability, some amount of safety stock must be maintained to achieve suitable serv
Publikováno v:
Annals of Operations Research. 110:83-106
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model incorporates transport costs from the suppliers to the DCs that explicitly
Publikováno v:
Annals of Operations Research. 76:95-107
We consider several different matching problems that are motivated by applications to selective assembly operations. In the case of maximum cardinality problems, we provide linear time greedy algorithms which we prove optimal via a min-max theorem. W
Publikováno v:
Networks. 29:151-160
This paper presents a polynomial-time algorithm for the minimum-weight-cycle problem on graphs that decompose via 3-separations into well-structured graphs. The problem is NP-hard in general. Graphs that decompose via 3-separations into well-structur
Autor:
Lisa Hellerstein, Collette R. Coullard
Publikováno v:
Combinatorica. 16:189-208
Given a matroidM with distinguished elemente, aport oracie with respect toe reports whether or not a given subset contains a circuit that containse. The first main result of this paper is an algorithm for computing ane-based ear decomposition (that i
Publikováno v:
Discrete Applied Mathematics. 66:33-43
This paper presents a linear-inequality description of the dominant of the polytope of the 2-connected Steiner subgraphs of a given W4-free graph. For the special case of 2-connected spanning subgraphs, a description of the polytope is given. The lat
Autor:
Peh H. Ng, Collette R. Coullard
Publikováno v:
Linear Algebra and its Applications. 230:101-125
A Leontief directed hypergraph is a generalization of a directed graph, where arcs have multiple (or no) tails and at most one head. We define a class of Leontief directed hypergraphs via a forbidden structure called an odd pseudocycle. We show that