✦ LIBER ✦

A branch-and-price algorithm for a targeting problem

✍ Scribed by Ojeong Kwon; Kyungsik Lee; Donghan Kang; Sungsoo Park

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 128 KB
Volume: 54
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20247

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-price algorithm for a hiera

A branch-and-price algorithm for a hierarchical crew scheduling problem

✍ Diego B.C. Faneyte; Frits C.R. Spieksma; Gerhard J. Woeginger 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

## Abstract We describe a real‐life problem arising at a crane rental company. This problem is a generalization of the basic crew scheduling problem given in Mingozzi et al. [18] and Beasley and Cao [6]. We formulate the problem as an integer programming problem and establish ties with the integer

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-price algorithm for switch-

A branch-and-price algorithm for switch-box routing

✍ David Grove Jørgensen; Morten Meyling 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB 👁 1 views

## Abstract Routing in VLSI design concerns the wiring of a chip after the logical modules have been placed. A subproblem occurring in VLSI design is switch‐box routing. Switch‐box routing can be formulated as the problem of packing Steiner trees in a grid graph. The only previous exact solution me

A robust branch-cut-and-price algorithm

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

✍ Artur Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views