Viser: Integer Programming

Integer Programming

Integer Programming

Laurence A. Wolsey
(1998)
Sprog: Engelsk
John Wiley & Sons, Incorporated
666,00 kr. 599,40 kr.
Print on demand. Leveringstid vil være ca 2-3 uger.
  • Klik for at bedømme:
  • 3.0/6 (76 bedømmelser)

Detaljer Om Varen

  • Hardback: 288 sider
  • Udgiver: John Wiley & Sons, Incorporated (September 1998)
  • ISBN: 9780471283669
A practical, accessible guide to optimization problems with discrete or integer variables 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. References.
Index.

Søg alle bøger

Titel eller forfatter eller ISBN

Ofte stillede spørgsmål

Hvor kan jeg hente mine bøger?

Hvad er studiepris?

 

Find svarene på disse og andre spørgsmål på FAQ siden 

Find Formlen

- vores egen formelsamling serie - udarbejdet af studerende for studerende og rettet mod dit DTU studie.

 

Find Formlen

 

Serien Find Formlen er udarbejdet af studerende der er langt i studiet og har været hjælpelærere i flere semestre og derfor præcist ved hvad der skal til.


De indeholder de vigtigste og hyppigst forekommende formler, som anvendes i den første del af studiet, og som det er nyttigt at have samlet i én overskuelig og let anvendelig oversigt.

 

Se alle Find Formlen bøger her