Results 1  10
of
407
On the capacitated vehicle routing problem
, 2001
"... We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Travelin ..."
Abstract

Cited by 46 (5 self)
 Add to MetaCart
and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two wellstudied problems. The capacity constraints of the integer programming formulation of this routing model provide the link between the underlying routing and packing structures. We describe a
A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
 European Journal of Operational Research
, 1996
"... Weintroduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations simultaneously.We presentan algorithm based on constraint satisfaction techniques to handle the problem e#ectively. The ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
Weintroduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations simultaneously.We presentan algorithm based on constraint satisfaction techniques to handle the problem e
Capacitated Domination Problem
"... We consider a generalization of the wellknown domination problem on graphs. The (soft) capacitated domination problem with demand constraints is to find a dominating set D of minimum cardinality satisfying both the capacity and demand constraints. The capacity constraint specifies that each vertex ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider a generalization of the wellknown domination problem on graphs. The (soft) capacitated domination problem with demand constraints is to find a dominating set D of minimum cardinality satisfying both the capacity and demand constraints. The capacity constraint specifies that each vertex
Simultaneous Routing and Resource Allocation via Dual Decomposition
, 2004
"... In wireless data networks the optimal routing of data depends on the link capacities which, in turn, are determined by the allocation of communications resources (such as transmit powers and bandwidths) to the links. The optimal performance of the network can only be achieved by simultaneous optimi ..."
Abstract

Cited by 171 (7 self)
 Add to MetaCart
optimization of routing and resource allocation. In this paper, we formulate the simultaneous routing and resource allocation problem and exploit problem structure to derive ef£cient solution methods. We use a capacitated multicommodity flow model to describe the data ¤ows in the network. We assume
Capacitated Trees, Capacitated Routing, and Associated Polyhedra
, 1990
"... We study the polyhedral structure of two related core combinatorial problems: the subtree cardinalityconstrained minimal spanning tree problem and the identical customer vehicle routing problem. For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introdu ..."
Abstract
 Add to MetaCart
vertex; (ii) a clique cluster, a collection of cliques intersecting at a single vertex, or more generally at a central " clique; and (iii) a ladybug, consisting of a multistar as a head and a clique as a body. We also consider packing (generalized subtour elimination) constraints, as well
On Capacitated Vehicle Routing
, 1998
"... We consider the capacitated vehicle routing problem (VRP): a fixed fleet of delivery vehicles of uniform capacity must service at minimal transit cost from a common depot known customer demand for a single commodity. This problem is modeled as a sideconstrained traveling salesman problem (TSP). Amo ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We consider the capacitated vehicle routing problem (VRP): a fixed fleet of delivery vehicles of uniform capacity must service at minimal transit cost from a common depot known customer demand for a single commodity. This problem is modeled as a sideconstrained traveling salesman problem (TSP
Scheduling MultiCapacitated Resources under Complex Temporal Constraints
, 1998
"... Most CSP scheduling models make the restrictive assumption that a resource can only support a single activity at a time (i.e., it is either available or inuse). However, in many practical domains, resources in fact have the capability to simultaneously support multiple activities, and hence availab ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
availability at any point is a function of unallocated capacity. In this paper, we develop and evaluate algorithms for solving multicapacitated scheduling problems. We first define a basic CSP model for this extended problem class, which provides a basic framework for formulating alternative solution
Robust branchandcutandprice for the capacitated vehicle routing problem
 IN PROCEEDINGS OF THE INTERNATIONAL NETWORK OPTIMIZATION CONFERENCE
, 2003
"... During the eigthies and early nineties, the best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) utilized lower bounds obtained by Lagrangean relaxation or column generation. Next, the advances in the polyhedral description of the CVRP yielded branchandcut algorithms giving bett ..."
Abstract

Cited by 60 (15 self)
 Add to MetaCart
During the eigthies and early nineties, the best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) utilized lower bounds obtained by Lagrangean relaxation or column generation. Next, the advances in the polyhedral description of the CVRP yielded branchandcut algorithms giving
Strong Inequalities for Capacitated Survivable Network Design Problems
 MATHEMATICAL PROGRAMMING
, 1999
"... We present several classes of facetdefining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex or edgedeletio ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
We present several classes of facetdefining inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex or edge
Results 1  10
of
407