𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lifting valid inequalities for the precedence constrained knapsack problem

✍ Scribed by R.L.M.J. van de Leensel; C.P.M. van Hoesel; J.J. van de Klundert

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
163 KB
Volume
86
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Formulations and Valid Inequalities for
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
✍ Hande Yaman πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 261 KB

We consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bound

The two-edge connected hop-constrained n
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
✍ David Huygens; Martine LabbΓ©; A. Ridha Mahjoub; Pierre Pesneau πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 389 KB

## Abstract This article deals with the Two‐edge connected Hop‐constrained Network Design Problem (or THNDP for short). Given a weighted graph __G__ = (__N__,__E__), an integer __L__ β‰₯ 2, and a subset of pairs of nodes __D__, the problem consists of finding the minimum cost subgraph in __G__ contai

An approximation algorithm for the prece
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
✍ Evripidis Bampis; Rodolphe Giroudeau; Jean-Claude KΓΆnig πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 153 KB

We study the problem of minimizing the makespan for the precedence multiprocessor constrained scheduling problem with hierarchical communications (Parallel Process. Lett. 10(1) (2000) 133). We propose an 8 5 -approximation algorithm for the Unit Communication Time hierarchical problem with arbitrary