Coverart for item
The Resource Integer programming and network models, H.A. Eiselt, C.-L. Sandblom ; with contributions by K. Spielberg ... [et al.]

Integer programming and network models, H.A. Eiselt, C.-L. Sandblom ; with contributions by K. Spielberg ... [et al.]

Label
Integer programming and network models
Title
Integer programming and network models
Statement of responsibility
H.A. Eiselt, C.-L. Sandblom ; with contributions by K. Spielberg ... [et al.]
Creator
Contributor
Subject
Language
eng
Cataloging source
DLC
http://library.link/vocab/creatorDate
1950-
http://library.link/vocab/creatorName
Eiselt, Horst A.
Illustrations
illustrations
Index
index present
LC call number
T57.74
LC item number
.E68 2000
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1942-
http://library.link/vocab/relatedWorkOrContributorName
Sandblom, Carl-Louis
http://library.link/vocab/subjectName
  • Integer programming
  • Network analysis (Planning)
Label
Integer programming and network models, H.A. Eiselt, C.-L. Sandblom ; with contributions by K. Spielberg ... [et al.]
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. [479]-500) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction: Basic Definitions and Results -- a. Linear Programming -- b. Analysis of Algorithms -- c. Graph Theory -- d. Dynamic Programming -- pt. I. Integer Programming -- 1. The Integer Programming Problem and its Properties -- 2. Formulations in Logical Variables -- 3. Applications and Special Structures -- 4. Reformulation of Problems -- 5. Cutting Plane Methods -- 6. Branch and Bound Methods -- 7. Heuristic Algorithms -- pt. II. Network Path Models -- 1. Tree Networks -- 2. Shortest Path Problems -- 3. Traveling Salesman Problems and Extensions -- 4. Arc Routing -- pt. III. Network Flow and Network Design Models -- 1. Basic Principles of Network Models -- 2. Applications of Network Flow Models -- 3. Network Flow Algorithms -- 4. Multicommodity Network Flows -- 5. Networks with Congestion
Control code
NYUGB12203178-B
Dimensions
25 cm.
Extent
xii, 504 p.
Isbn
9783540671916
Lccn
00056319
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
ill.
Label
Integer programming and network models, H.A. Eiselt, C.-L. Sandblom ; with contributions by K. Spielberg ... [et al.]
Publication
Bibliography note
Includes bibliographical references (p. [479]-500) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Introduction: Basic Definitions and Results -- a. Linear Programming -- b. Analysis of Algorithms -- c. Graph Theory -- d. Dynamic Programming -- pt. I. Integer Programming -- 1. The Integer Programming Problem and its Properties -- 2. Formulations in Logical Variables -- 3. Applications and Special Structures -- 4. Reformulation of Problems -- 5. Cutting Plane Methods -- 6. Branch and Bound Methods -- 7. Heuristic Algorithms -- pt. II. Network Path Models -- 1. Tree Networks -- 2. Shortest Path Problems -- 3. Traveling Salesman Problems and Extensions -- 4. Arc Routing -- pt. III. Network Flow and Network Design Models -- 1. Basic Principles of Network Models -- 2. Applications of Network Flow Models -- 3. Network Flow Algorithms -- 4. Multicommodity Network Flows -- 5. Networks with Congestion
Control code
NYUGB12203178-B
Dimensions
25 cm.
Extent
xii, 504 p.
Isbn
9783540671916
Lccn
00056319
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
ill.

Library Locations

    • Harold Cohen LibraryBorrow it
      Ashton Street, Liverpool, L69 3DA, GB
      53.418074 -2.967913
Processing Feedback ...