𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch-and-price approach for the maximum weight independent set problem

✍ Scribed by Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
124 KB
Volume
46
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch-and-price algorithm for the cap
A branch-and-price algorithm for the capacitated p-median problem
✍ Alberto Ceselli; Giovanni Righini πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 178 KB πŸ‘ 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
✍ Fischetti, Matteo; Vigo, Daniele πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.

A branch-and-price-based large neighborh
A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr