𝔖 Bobbio Scriptorium
✦   LIBER   ✦

GRASP with path relinking heuristics for the antibandwidth problem

✍ Scribed by A. Duarte; R. Martí; M.G.C. Resende; R.M.A. Silva

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
222 KB
Volume
58
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A GRASP with path-relinking for private
A GRASP with path-relinking for private virtual circuit routing
✍ Mauricio G. C. Resende; Celso C. Ribeiro 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract A frame relay service offers virtual private networks to customers by provisioning a set of long‐term private virtual circuits (PVCs) between customer endpoints on a large backbone network. During the provisioning of a PVC, routing decisions are made without any knowledge of future requ

An efficient heuristic for the multi-ite
An efficient heuristic for the multi-item newsboy problem with a single constraint
✍ Steven Nahmias; Charles P. Schmidt 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici

Inapproximability results for the invers
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th

A reactive tabu search meta-heuristic fo
A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
✍ Ibrahim H. Osman; Niaz A. Wassan 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 195 KB

The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction

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