• Wiley

  • Paru le : 21/02/2000
Note moyenne : |
Ce produit n'a pas encore été évalué. Soyez le premier !
Donnez votre avis !
Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custom-made algorithms or use existing commercial... > Lire la suite
130,20 €
Neuf - Expédié sous 9 à 14 jours
  • ou
    Livré chez vous
    entre le 1 décembre et le 6 décembre
Votre note
Integer Programming stands out from other textbooks by explaining in clear and simple terms how to construct custom-made algorithms or use existing commercial software to obtain optimal or near-optimal solutions for a variety of real-world problems, such as airline timetables, production line schedules, or electricity production on a regional or national scale. Incorporating recent developments that have made it possible to solve difficult optimization problems with greater accuracy, author Laurence A. Wolsey presents a number of state-of-the-art topics not covered in any other textbook. These include improved modeling, cutting plane theory and algorithms, heuristic methods, and branch-and-cut and integer programming decomposition algorithms. This self-contained text: • Distinguishes between good and bad formulations in integer programming problems • Applies lessons learned from easy integer programs to more difficult problems • Demonstrates with applications theoretical and practical aspects of problem solving • Includes useful notes and end-of-chapter exercises • Offers tremendous flexibility for tailoring material to different needs Integer Programming is an ideal text for courses in integer/mathematical programming - whether in operations research, mathematics, engineering, or computer science departments. It is also a valuable reference for industrial users of integer programming and researchers who would like to keep up with advances in the field.
    • Formulations
    • Optimality, Relaxation, and Bounds
    • Well-Solved Problems
    • Matchings and Assignments
    • Dynamic Programming
    • Complexity and Problem Reductions
    • Branch and Bound
    • Cutting Plane Algorithms
    • Strong Valid Inequalities
    • Lagrangian Duality
    • Column Generation Algorithms
    • Heuristic Algorithms
    • From Theory to Solutions.
  • Date de parution : 21/02/2000
  • Editeur : Wiley
  • Collection : discrete mathematics optimizat
  • ISBN : 0-471-28366-5
  • EAN : 9780471283669
  • Présentation : Relié
  • Nb. de pages : 264 pages
  • Poids : 0.585 Kg
  • Dimensions : 16,1 cm × 24,3 cm × 1,9 cm

Biographie de Laurence-A Wolsey

LAURENCE A. WOLSEY is Professor of Applied Mathematics at the Center for Operations Research and Econometrics (CORE) at l'Université Catholique de Louvain at Louvain-la-Neuve, Belgium. He is the author, with George Nemhauser, of Integer and Combinatorial Optimization (Wiley).

Nos avis clients sur

Avis Trustpilot
Laurence-A Wolsey - .
130,20 €
Haut de page
Decitre utilise des cookies pour vous offrir le meilleur service possible. En continuant votre navigation, vous en acceptez l'utilisation. En savoir plus OK