Articoli correlati a Integer Programming and Network Models
Sinossi
The purpose of this book is to provide readers with an introduction to the very active field of integer programming and network models. The idea is to cover the main parts of the field without being too detailed or too technical. As a matter of fact, we found it somewhat surprising that most--especially newer---books are strongly algorithmically oriented. In contrast, the main emphasis of this book is on models rather than methods. This focus expresses our view that methods are tools to solve actual problems and not ends in themselves. As such, graduate (and with some omissions, undergraduate) students may find this book helpful in their studies as will practitioners who would like to get acquainted with a field or use this text as a refresher. This premise has resulted in a coverage that omits material that is standard fare in other books, whereas it covers topics that are only infrequently found elsewhere. There are some, yet relatively few, prerequisites for the reader. Most material that is required for the understanding of more than one chapter is presented in one of the four chapters of the introductory part, which reviews the main results in linear programming, the analysis of algorithms, graphs and networks, and dynamic programming, respectively. Readers who are familiar with the issues involved can safely skip that part. The three main parts of the book rely on intuitive reasoning and examples, whenever practical, instead of theorems and proofs.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Basic Definitions and Results: Some Results in Linear Programming.- An Introduction to the Analysis of Algorithms.- Introduction to Graph Theory.- Dynamic Programming.- Integer Programming: The Integer Programming Problem and its Properties.- Formulations in Logical Variables.- Applications and Special Structures.- Reformulation of Problems.- Cutting Plane Methods.- Branch and Bound Methods.- Heuristic Algorithms.- Network Path Models: Tree Networks.- Shortest Path Problems.- Traveling Salesman Problems and Extensions.- Arc Routing.- Network Flow and Network Design Models: Basic Principles of Network Flow Models.- Applications of Network Flow Models.- Network Flow Algorithms.- Multicommodity Network Flows.- Networks with Congestion.
Product Description
Book by Eiselt HA Sandblom CL
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 167,15
EUR 2,26 per la spedizione in U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Integer Programming and Network Models
Immagini fornite dal venditore
Integer Programming and Network Models.
Da: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
Valutazione del venditore 5 su 5 stelle
gebundene Ausgabe. Condizione: Gut. 504 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); Schnitt und Einband sind etwas staubschmutzig; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Text in ENGLISCHER Sprache! Sprache: Englisch Gewicht in Gramm: 880. Codice articolo 1584640
Quantità: 1 disponibili
Foto dell'editore
Integer Programming and Network Models
Da: Textbooks_Source, Columbia, MO, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Good. 2000th Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Codice articolo 000958918U
Quantità: 4 disponibili
Foto dell'editore
Integer Programming and Network Models
Da: thebookforest.com, San Rafael, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: LikeNew. Page block firm and clean, binding unblemished, boards straight, no markings of any kind. Fine, like new condition. Well packaged and promptly shipped from California. US veteran operated. Codice articolo 1LAGBP001WL2
Quantità: 1 disponibili
Foto dell'editore
Integer Programming and Network Models
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Very Good. Cover and edges may have some wear. Codice articolo mon0003655765
Quantità: 4 disponibili
Immagini fornite dal venditore
Integer Programming and Network Models
Da: killarneybooks, Inagh, CLARE, Irlanda
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. Hardcover, xii + 504 pages, 165 figures, 43 tables, NOT ex-library. Printed in Germany, not an economy edition. Missing front blank endpaper, otherwise interior is VG: clean throughout with unmarked text, free of inscriptions/stamps, firmly bound. Boards show moderate shelfwear, short creases to edges, gently bent and scuffed lower outer corner of front panel; a crease to upper spine edge. Issued without a dust jacket. -- Contents: Introduction: Basic Definitions & Results: - Linear Programming [Fundamental Concepts & Simplex Method; Duality & Postoptimality Analysis; Problems with Special Structures] - Analysis of Algorithms [Algorithms & Time Complexity Functions; Time Complexity Functions Examples; Classes of Problems & Their Relations] - Graph Theory [Basic Definitions & Examples; Representation & Storage of Graphs; Reachability & Connectivity; Graphs with Special Structures] - Dynamic Programming [Basic Ideas; General Algorithm; Various Examples]; Pt1: Integer Programming: 1 Integer Programming Problem & its Properties [Definitions & Basic Concepts; Relaxations of Integer Programming Problems; Polyhedral Combinatorics] 2 Formulations in Logical Variables [Modeling of Discrete Variables & Fixed Charges; Disjunctive Variables; Constraint Selection; Imposing a Sequence on Variables & Constraints; Absolute Values of Functions & Nonconcave Objectives (Problem with Collective & Individual Absolute Values & Nonconcave Objective); Piecewise Linear Functions; Semicontinuous Variables] 3 Applications & Special Structures [Applications (Distribution-Location & Cutting Stock Problem; Examination Timetabling; Forestry Harvesting; Technology Choice; Political Districting; Apportionment Problems; Open Pit Mining; Bin Packing & Assembly Line Planning); Problems with Special Structures (Knapsack Problems; Set Covering, Set Packing & Set Partitioning Problems] 4 Reformulation of Problems [Strong & Weak Formulations; Model Strengthening & Logical Processing (Single & Multiple Constraint Procedures); Aggregation; Disaggregation] 5 Cutting Plane Methods [Dantzig's; Gomory's; For Mixed Integer Programming] 6 Branch & Bound Methods [Basic Principles; Search Strategies (Node & Branch Selection); General Branch & Bound Procedure; Difficult Problems; Integer Programming Duality & Relaxation; Lagrangean Decomposition] 7 Heuristic Algorithms [Neighborhood Search; Simulated Annealing; Tabu Search; Genetic Algorithms; Other Approaches]; Pt2: Network Path Models: 1 Tree Networks [Minimal Spanning Trees; Extensions of Minimal Spanning Tree Problems; Connectivity & Reliability; Steiner Tree Problem] 2 Shortest Path Problems [Problem & its Formulation; Applications of Shortest Paths; Solution Methods (Dijkstra's; Bellman-Ford-Moore & Floyd-Warshall Algorithm); Extensions of the Basic Problem] 3 Traveling Salesman Problems & Extensions [Problem & its Applications; Exact & Heuristic Algorithms; Vehicle Routing Problems] 4 Arc Routing [Euler Graphs & Cycles; Constructing Eulerian Graphs; Rural Postman Problems; Capacitated Arc Routing Problem]; Pt3: Network Flow & Network Design Models: 1 Basic Principles of Network Models [Problem & its Formulation; Transformations of Flow Problems; Duality & Optimality Conditions; Some Fundamental Results] 2 Applications of Network Flow Models [Building Evacuation; Flow Sharing Problems; Worker Allocation Problem; Airline Crew Assignment; Allocation of Representatives to Committees; Computer Program Testing; Distributed Computing; Matrix Balancing & Rounding Problems] 3 Network Flow Algorithms [Maximal Flow Algorithms (Ford & Fulkerson; Karzanov's Preflow Algorithm); Feasible Flow Problems; Cost-Minimal Flow Problems] 4 Multicommodity Network Flows [Model, ist Formulation & Properties; Solution Methods (Price- & Resource Directive Decomposition); Network Design Problems] 5 Networks with Congestion [System- & User-Optimal Network Flows; Solving Flow Assignment Problem; Discrete Route Assignment; Network Design Problems]. Codice articolo 005486
Quantità: 1 disponibili
Immagini fornite dal venditore
Integer Programming and Network Models
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. Codice articolo 919006-5
Quantità: 4 disponibili
Immagini fornite dal venditore
Integer Programming and Network Models
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 919006-n
Quantità: Più di 20 disponibili
Foto dell'editore
Integer Programming and Network Models
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020174506
Quantità: Più di 20 disponibili
Foto dell'editore
Integer Programming and Network Models (Hardcover)
Editore:
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2000
ISBN 10: 3540671919
ISBN 13: 9783540671916
Nuovo
Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. The book presents a unified treatment of integer programming and network models with topics ranging from exact and heuristic algorithms to network flows, traveling salesman tours, and traffic assignment problems. While the emphasis of the book is on models and applications, the most important methods and algorithms are described in detail and illustrated by numerical examples. The formulations and the discussion of a large variety of models provides insight into their structures that allows the user to better evaluate the solutions to the problems. The purpose of this book is to provide readers with an introduction to the very active field of integer programming and network models. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9783540671916
Quantità: 1 disponibili
Foto dell'editore
Integer Programming and Network Models
Editore:
Springer Berlin Heidelberg, 2000
ISBN 10: 3540671919
ISBN 13: 9783540671916
Antico o usato
Rilegato
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher. Codice articolo 18514/1
Quantità: 1 disponibili