In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint
Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
✍ Scribed by Alysson M. Costa; Jean-François Cordeau; Gilbert Laporte
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 246 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precede
This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item