Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
Knapsack Problems
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

Knapsack Problems

Knapsack Problems

With 105 Figures and 33 Tables

Hans Kellerer, Ulrich Pferschy, David Pisinger

546 pages, parution le 31/12/2003

Résumé

This book provides a full-scale presentation of all methods and techniques available for the solution of the Knapsack problem. This most basic combinatorial optimization problem appears explicitly or as a subproblem in a wide range of optimization models with backgrounds such diverse as cutting and packing, finance, logistics or general integer programming. This monograph spans the range from a comprehensive introduction of classical algorithmic methods to the unified presentation of the most recent and advanced results in this area many of them originating from the authors. The chapters dealing with particular versions and extensions of the Knapsack problem are self-contained to a high degree and provide a valuable source of reference for researchers.
Due to its simple structure, the Knapsack problem is an ideal model for introducing solution techniques to students of computer science, mathematics and economics. The first three chapters give an in-depth treatment of several basic techniques, making the book also suitable as underlying literature for courses in combinatorial optimization and approximation.

Written for:
Researchers, practitioners

Sommaire

  • Introduction
  • Basic Algorithmic Concepts
  • Advanced Algorithmic Concepts
  • The Subset Sun Problem
  • Exact Solution of the Knapsack Problem
  • Approximation Algorithms for the Knapsack Problem
  • The Bounded Knapsack Problem
  • The Unbounded Knapsack Problem
  • Multidimensional Knapsack Problems
  • Multiple Knapsack Problems
  • The Multiple-Choice Knapsack Problem
  • The Quadratic Knapsack Problem
  • Other Knapsack Problems
  • Stochastic Aspects of Knapsack Problems
  • Some Selected Applications
  • A.Introduction to NP-Completeness of Knapsack Problems
Voir tout
Replier

Caractéristiques techniques

  PAPIER
Éditeur(s) Springer
Auteur(s) Hans Kellerer, Ulrich Pferschy, David Pisinger
Parution 31/12/2003
Nb. de pages 546
Format 16 x 24
Couverture Broché
Poids 955g
Intérieur Noir et Blanc
EAN13 9783540402862

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription