𝔖 Bobbio Scriptorium
✦   LIBER   ✦

LP relaxation of the two dimensional knapsack problem with box and GUB constraints

✍ Scribed by Ansuman Bagchi; Nalinaksha Bhattacharyya; Nilotpal Chakravarti

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
563 KB
Volume
89
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Tabu search heuristic for the vehicle
A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvaro Martello πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 233 KB

## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive

Erratum: A Tabu search heuristic for the
Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints
✍ Michel Gendreau; Manuel Iori; Gilbert Laporte; Silvano Martello πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 45 KB

In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell