This paper describes a branch-and-cut algorithm for the Capacitated LocationRouting Problem (CLRP). In the CLRP customers with known demands must be served from capacitated facilities by an unlimited fleet of homogeneous, capacitated vehicles. The problem is to select a subset of potential facilities and to design vehicle routes around these facilities so that every customer is visited exactly ...

IEEE 802.16, also known as WiMAX (Worldwide Inter-operability for Microwave Access), is a new wireless access technology for current increasing demand of wireless high-speed broadband service. Efficient and effective deployment of such a network to service an area of users with certain traffic demands is an important network planning problem. This network planning can be formulated in a similar...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

The Mab 4B12 produced by us against capacitated boar spermatozoa was found to recognize a protein located in the acrosome portion of capacitated boar spermatozoa which is shared by different animal species, dogs included. It was shown that Mab 4B12 might affect fertilizing ability in vitro of boar spermatozoa. Using indirect immunofluorescence (IIF) test, we provide evidence here that Mab 4B12 ...

A branch-and-cut algorithm for the capacitated profitable tour problem.

In cutting and packing problems, Dual Feasible Functions (DFFs) represent a well established tool for deriving high quality lower bounds in very short times. A well-known DFF lower bounding approach consists of using DFFs to rapidly generate feasible values for the dual variables of a Column Generation (CG) program (i.e., of an extended formulation commonly associated to CG). This paper present...

Given an edge-capacitated undirected graph G = (V ,E,C) with edge capacity c :E → R+, n = |V |, an s − t edge cut C of G is a minimal subset of edges whose removal from G will separate s from t in the resulting graph, and the capacity sum of the edges in C is the cut value of C. A minimum s − t edge cut is an s − t edge cut with the minimum cut value among all s − t edge cuts. A theorem given b...

We study mechanisms for combinatorial auctions that are simultaneously incentive compatible (IC), envy free (EF) and efficient in settings with capacitated valuations — a subclass of subadditive valuations introduced by Cohen et al. [4]. Capacitated agents have valuations which are additive up to a publicly known capacity. The main result of Cohen et al. [4] is the assertion that the Vickrey-Cl...

We study mechanisms for combinatorial auctions that are simultaneously incentive compatible (IC), envy free (EF) and efficient in settings with capacitated valuations — a subclass of subadditive valuations introduced by Cohen et al. [4]. Capacitated agents have valuations which are additive up to a publicly known capacity. The main result of Cohen et al. [4] is the assertion that the VickreyCla...

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...