Browsing by Keywords "Valid inequalities"
Now showing items 118 of 18

A branch and cut algorithm for the inventory routing problem
(Bilkent University, 201907)The inventory routing problem arises in vendor managed systems where products are distributed from a supplier to a set of retailers by a homogeneous eet of capacitated vehicles. The routes of the vehicles and the ... 
A branchandcut algorithm for the hub location and routing problem
(Elsevier, 2014)We study the hub location and routing problem where we decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total ... 
A branchandcut algorithm for twolevel survivable network design problems
(Elsevier, 2016)This paper approaches the problem of designing a twolevel network protected against singleedge failures. The problem simultaneously decides on the partition of the set of nodes into terminals and hubs, the connection of ... 
Comparison of the formulations for a hubandspoke network design problem under congestion
(Elsevier, 2016)In this paper, we study the hub location problem with a powerlaw congestion cost and propose an exact solution approach. We formulate this problem in a conic quadratic form and use a strengthening method which rests on ... 
Formulations and valid inequalities for the heterogeneous vehicle routing problem
(Springer, 2006)We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on MillerTuckerZemlin ... 
Hierarchical multimodal hub location problem with timedefinite deliveries
(Elsevier, 2012)Hierarchical multimodal hub location problem is a costminimizing hub covering problem where two types of hubs and hub links, accounting for ground and air transportation, are to be established, while ensuring timedefinite ... 
The integer knapsack cover polyhedron
(Society for Industrial and Applied Mathematics, 2007)We study the integer knapsack cover polyhedron which is the convex hull of the set of vectors x ∈ ℤ+ n that satisfy C T x ≥ b, with C ∈ ℤ++ n and 6 ∈ ℤ++. We present some general results about the nontrivial facetdefining ... 
An intermodal multicommodity routing problem with scheduled services
(2012)We study a multicommodity routing problem faced by an intermodal service operator that uses ground and maritime transportation. Given a planning horizon, a set of commodities to be picked up at their release times and to ... 
knodedisjoint hopconstrained survivable networks: polyhedral analysis and branch and cut
(SpringerVerlag France, 2018)Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the knodedisjoint hopconstrained network design problem is to find a minimum weight subgraph of ... 
The latest arrival hub location problem for cargo delivery systems with stopovers
(Elsevier, 2007)In this paper, we concentrate on the service structure of groundtransportation based cargo delivery companies. The transient times that arise from nonsimultaneous arrivals at hubs (typically spent for unloading, loading, ... 
Lot sizing with perishable items
(Bilkent University, 201907)We address the uncapacitated lot sizing problem for a perishable item that has a deterministic and fixed lifetime. In the first part of the study, we assume that the demand is also deterministic. We conduct a polyhedral ... 
Manufacturer's mixed pallet design problem
(Elsevier, 2008)We study a problem faced by a major beverage producer. The company produces and distributes several brands to various customers from its regional distributors. For some of these brands, most customers do not have enough ... 
New exact solution approaches for the split delivery vehicle routing problem
(Springer Verlag, 2018)In this study, we propose exact solution methods for the split delivery vehicle routing problem (SDVRP). We first give a new vehicleindexed flow formulation for the problem and then a relaxation obtained by aggregating ... 
The periodic vehicle routing problem with driver consistency
(Elsevier, 2018)The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ... 
The periodic vehicle routing problem with driver consistency
(Elsevier, 2018)The Periodic Vehicle Routing Problem is a generalization of the classical capacitated vehicle routing problem in which routes are determined for a planning horizon of several days. Each customer has an associated set of ... 
The ring/κrings network design problem: model and branchandcut algorithm
(John Wiley & Sons, 2016)This article considers the problem of designing a twolevel network where the upper level consists of a backbone ring network connecting the socalled hub nodes, and the lower level is formed by access ring networks that ... 
Time constrained maximal covering salesman problem with weighted demands and partial coverage
(Elsevier Ltd, 2016)In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of ... 
The vendor location problem
(Elsevier, 2011)The vendor location problem is the problem of locating a given number of vendors and determining the number of vehicles and the service zones necessary for each vendor to achieve at least a given profit. We consider two ...