Integer programming / by Laurence A. Wolsey.

By:

Wolsey, Laurence A

Material type: Text

TextPublication details: New York : A wiley interscience publication, 1975.Edition: 2nd edDescription: 243pISBN:

9781119606536

Subject(s):

Integer programming

DDC classification:

616.89142 YAT

Summary: "An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. Contains a new chapter on Benders' algorithm, as there have been many successful applications of Benders' algorithm since the first edition published. Provides improved presentation of Branch-and-Price Algorithms. Contains an introduction to Branch-Cut and Price. Includes new heuristics within mixed integer programming (MIP) codes and user implemented heuristics using a Modelling Language and a MIP solver . Supplementary material consists of solutions to some exercises, available to instructors on a Wiley Instructor Companion Site"--

Tags from this library: No tags from this library for this title. Log in to add tags.

Holdings
Item type	Current library	Home library	Call number	Status	Date due	Barcode
Book	Dept. of Psychology General Stacks	Dept. of Psychology	616.89142 YAT (Browse shelf(Opens below))	Available		PSY4397

Browsing Dept. of Psychology shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)

Previous								Next
Previous	616.89142 WES An Introduction to Cognitive Behavior Therapy : skills and applications	616.89142 WIL Skills in Cognitive Behaviour Counselling and Psychotherapy	616.89142 YAT Behavior therapy /	616.89142 YAT Integer programming /	616.891425 RAK An introduction to CBT research /	616.89143 CLA Gestalt Counselling in Action /	616.89143 DOB Advances In Cognitive Behavioral Therapy /	Next

Includes bibliographical references and index.

"An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. Contains a new chapter on Benders' algorithm, as there have been many successful applications of Benders' algorithm since the first edition published. Provides improved presentation of Branch-and-Price Algorithms. Contains an introduction to Branch-Cut and Price. Includes new heuristics within mixed integer programming (MIP) codes and user implemented heuristics using a Modelling Language and a MIP solver . Supplementary material consists of solutions to some exercises, available to instructors on a Wiley Instructor Companion Site"--

There are no comments on this title.

to post a comment.