Linear programming and network flows:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, NJ
Wiley
2010
|
| Ausgabe: | 4. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | XIV, 748 S. graph. Darst. |
| ISBN: | 9780470462720 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV036068689 | ||
| 003 | DE-604 | ||
| 005 | 20100908 | ||
| 007 | t | ||
| 008 | 100309s2010 d||| |||| 00||| eng d | ||
| 010 | |a 2009028769 | ||
| 020 | |a 9780470462720 |9 978-0-470-46272-0 | ||
| 035 | |a (OCoLC)419865390 | ||
| 035 | |a (DE-599)GBV605528608 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 |a DE-20 |a DE-703 |a DE-M347 |a DE-384 |a DE-11 | ||
| 050 | 0 | |a T57.74 | |
| 082 | 0 | |a 519.7/2 |2 22 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 100 | 1 | |a Bazaraa, Mokhtar S. |d 1943- |e Verfasser |0 (DE-588)13576856X |4 aut | |
| 245 | 1 | 0 | |a Linear programming and network flows |c Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali |
| 250 | |a 4. ed. | ||
| 264 | 1 | |a Hoboken, NJ |b Wiley |c 2010 | |
| 300 | |a XIV, 748 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 0 | |a Linear programming | |
| 650 | 0 | |a Network analysis (Planning) | |
| 650 | 4 | |a Linear programming | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lineare Optimierung |0 (DE-588)4035816-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 0 | 1 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 1 | 1 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
| 689 | 1 | 2 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 2 | 1 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
| 689 | 2 | 2 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Jarvis, John J. |d 1941- |e Verfasser |0 (DE-588)138447896 |4 aut | |
| 700 | 1 | |a Sherali, Hanif D. |d 1952- |e Verfasser |0 (DE-588)135768586 |4 aut | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018960002&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-018960002 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804141117960093696 |
|---|---|
| adam_text | LINEAR PROGRAMMING AND NETWORK FLOWS FOURTH EDITION MOKHTAR S. BAZARAA
AGILITY LOGISTICS ATLANTA, GEORGIA JOHN J. JARVIS GEORGIA INSTITUTE OF
TECHNOLOGY SCHOOL OF INDUSTRIAL AND SYSTEMS ENGINEERING ATLANTA, GEORGIA
HANIFD.SHERALI VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY GRADO
DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING BLACKSBURG, VIRGINIA
WILEY A JOHN WILEY & SONS, INC., PUBLICATION CONTENTS XI ONE:
INTRODUCTION 1 1.1 THE LINEAR PROGRAMMING PROBLEM 1 1.2 LINEAR
PROGRAMMING MODELING AND EXAMPLES 7 1.3 GEOMETRIE SOLUTION 18 1.4 THE
REQUIREMENT SPACE 22 1.5 NOTATION 27 EXERCISES 29 NOTES AND REFERENCES
42 TWO: LINEAR ALGEBRA, CONVEX ANALYSIS, AND POLYHEDRAL SETS 45 2.1
VECTORS 45 2.2 MATRICES 51 2.3 SIMULTANEOUS LINEAR EQUATIONS 61 2.4
CONVEX SETS AND CONVEX FUNCTIONS 64 2.5 POLYHEDRAL SETS AND POLYHEDRAL
CONES 70 2.6 EXTREME POINTS, FACES, DIRECTIONS, AND EXTREME DIRECTIONS
OF POLYHEDRAL SETS: GEOMETRIC INSIGHTS 71 2.7 REPRESENTATION OF
POLYHEDRAL SETS 75 EXERCISES 82 NOTES AND REFERENCES 90 THREE: THE
SIMPLEX METHOD 91 3.1 EXTREME POINTS AND OPTIMALITY 91 3.2 BASIC
FEASIBLE SOLUTIONS 94 3.3 KEY TO THE SIMPLEX METHOD 103 3.4 GEOMETRIC
MOTIVATION OF THE SIMPLEX METHOD 104 3.5 ALGEBRA OF THE SIMPLEX METHOD
108 3.6 TERMINATION: OPTIMALITY AND UNBOUNDEDNESS 114 3.7 THE SIMPLEX
METHOD 120 3.8 THE SIMPLEX METHOD IN TABLEAU FORMAT 125 3.9 BLOCK
PIVOTING 134 EXERCISES 135 NOTES AND REFERENCES 148 FOUR: STARTING
SOLUTION AND CONVERGENCE 151 4.1 THE INITIAL BASIC FEASIBLE SOLUTION 151
4.2 THE TWO-PHASE METHOD 154 4.3 THE BIG-MMETHOD 165 4.4 HOW BIG SHOULD
BIG-MBE? 172 4.5 THE SINGLE ARTIFICIAL VARIABLE TECHNIQUE 173 4.6
DEGENERACY, CYCLING, AND STALLING 175 4.7 VALIDATION OF CYCLING
PREVENTION RULES 182 EXERCISES 187 NOTES AND REFERENCES 198 FIVE:
SPECIAL SIMPLEX IMPLEMENTATIONS AND OPTIMALITY CONDITIONS 201 5.1 THE
REVISED SIMPLEX METHOD 201 5.2 THE SIMPLEX METHOD FOR BOUNDED VARIABLES
220 VLLL CONTENTS 5.3 FARKAS LEMMA VIA THE SIMPLEX METHOD 234 5.4 THE
KARUSH-KUHN-TUCKER OPTIMALITY CONDITIONS 237 EXERCISES 243 NOTES AND
REFERENCES 256 SIX: DUALITY AND SENSITIVITY ANALYSIS 25 9 6.1
FORMULATION OF THE DUAL PROBLEM 259 6.2 PRIMAL-DUAL RELATIONSHIPS 264
6.3 ECONOMIC INTERPRETATION OF THE DUAL 270 6.4 THE DUAL SIMPLEX METHOD
277 6.5 THE PRIMAL-DUAL METHOD 285 6.6 FINDING AN INITIAL DUAL FEASIBLE
SOLUTION: THE ARTIFICIAL CONSTRAINT TECHNIQUE 293 6.7 SENSITIVITY
ANALYSIS 295 6.8 PARAMETRIC ANALYSIS 312 EXERCISES 319 NOTES AND
REFERENCES 336 SEVEN: THE DECOMPOSITION PRINCIPLE 339 7.1 THE
DECOMPOSITION ALGORITHM 340 7.2 NUMERICAL EXAMPLE 345 7.3 GETTING
STARTED 353 7.4 THE CASE OF AN UNBOUNDED REGION^ 354 7.5 BLOCK DIAGONAL
OR ANGULAR STRUCTURE 361 7.6 DUALITY AND RELATIONSHIPS WITH OTHER
DECOMPOSITION PROCEDURES 371 EXERCISES 376 NOTES AND REFERENCES 391
EIGHT: COMPLEXITY OF THE SIMPLEX ALGORITHM AND POLYNOMIAL-TIME
ALGORITHMS 393 8.1 POLYNOMIAL COMPLEXITY ISSUES 393 8.2 COMPUTATIONAL
COMPLEXITY OF THE SIMPLEX ALGORITHM 397 8.3 KHACHIAN S ELLIPSOID
ALGORITHM 401 8.4 KARMARKAR S PROJECTIVE ALGORITHM 402 8.5 ANALYSIS OF
KARMARKAR S ALGORITHM: CONVERGENCE, COMPLEXITY, SLIDING OBJECTIVE
METHOD, AND BASIC OPTIMAL SOLUTIONS 417 8.6 AFFINE SCALING, PRIMAL-DUAL
PATH FOLLOWING, AND PREDICTOR-CORRECTOR VARIANTS OF INTERIOR POINT
METHODS 428 EXERCISES 435 NOTES AND REFERENCES 448 NINE: MINIMAL-COST
NETWORK FLOWS 45 3 9.1 THE MINIMAL COST NETWORK FLOW PROBLEM 453 9.2
SOME BASIC DEFINITIONS AND TERMINOLOGY FROM GRAPH THEORY 455 9.3
PROPERTIES OF THE A MATRIX 459 9.4 REPRESENTATION OF A NONBASIC VECTOR
IN TERMS OF THE BASIC VECTORS 465 9.5 THE SIMPLEX METHOD FOR NETWORK
FLOW PROBLEMS 466 9.6 AN EXAMPLE OF THE NETWORK SIMPLEX METHOD 475 9.7
FINDING AN INITIAL BASIC FEASIBLE SOLUTION 475 9.8 NETWORK FLOWS WITH
LOWER AND UPPER BOUNDS 478 CONTENTS IX 9.9 THE SIMPLEX TABLEAU
ASSOCIATED WITH A NETWORK FLOW PROBLEM 481 9.10 LIST STRUCTURES FOR
IMPLEMENTING THE NETWORK SIMPLEX ALGORITHM 482 9.11 DEGENERACY, CYCLING,
AND STALLING 488 9.12 GENERALIZED NETWORK PROBLEMS 494 EXERCISES 497
NOTES AND REFERENCES 511 TEN: THE TRANSPORTATION AND ASSIGNMENT PROBLEMS
513 10.1 DEFINITION OF THE TRANSPORTATION PROBLEM 513 10.2 PROPERTIES OF
THE A MATRIX 516 10.3 REPRESENTATION OF A NONBASIC VECTOR IN TERMS OF
THE BASIC VECTORS 520 10.4 THE SIMPLEX METHOD FOR TRANSPORTATION
PROBLEMS 522 10.5 ILLUSTRATIVE EXAMPLES AND A NOTE ON DEGENERACY 528
10.6 THE SIMPLEX TABLEAU ASSOCIATED WITH A TRANSPORTATION TABLEAU 535
10.7 THE ASSIGNMENT PROBLEM: (KUHN S) HUNGARIAN ALGORITHM 535 10.8
ALTERNATING PATH BASIS ALGORITHM FOR ASSIGNMENT PROBLEMS..544 10.9 A
POLYNOMIAL-TIME SUCCESSIVE SHORTEST PATH APPROACH FOR ASSIGNMENT
PROBLEMS 546 10.10 THE TRANSSHIPMENT PROBLEM 551 EXERCISES 552 NOTES AND
REFERENCES 564 ELEVEN: THE OUT-OF-KILTER ALGORITHM 567 11.1 THE
OUT-OF-KILTER FORMULATION OF A MINIMAL COST NETWORK FLOW PROBLEM 567
11.2 STRATEGY OF THE OUT-OF-KILTER ALGORITHM 573 11.3 SUMMARY OFTHE
OUT-OF-KILTER ALGORITHM 586 11.4 AN EXAMPLE OFTHE OUT-OF-KILTER
ALGORITHM 587 11.5 A LABELING PROCEDURE FOR THE OUT-OF-KILTER ALGORITHM
589 11.6 INSIGHT INTO CHANGES IN PRIMAL AND DUAL FUNCTION VALUES 591
11.7 RELAXATION ALGORITHMS 593 EXERCISES 595 NOTES AND REFERENCES 605
TWELVE: MAXIMAL FLOW, SHORTEST PATH, MULTICOMMODITY FLOW, AND NETWORK
SYNTHESIS PROBLEMS 607 12.1 THE MAXIMAL FLOW PROBLEM 607 12.2 THE
SHORTEST PATH PROBLEM 619 12.3 POLYNOMIAL-TIME SHORTEST PATH ALGORITHMS
FOR NETWORKS HAVING ARBITRARY COSTS 635 12.4 MULTICOMMODITY FLOWS 639
12.5 CHARACTERIZATION OF A BASIS FOR THE MULTICOMMODITY MINIMAL-COST
FLOW PROBLEM 649 12.6 SYNTHESIS OF MULTITERMINAL FLOW NETWORKS 654
EXERCISES 663 NOTES AND REFERENCES 678 BIBLIOGRAPHY 681 INDEX 733
|
| any_adam_object | 1 |
| author | Bazaraa, Mokhtar S. 1943- Jarvis, John J. 1941- Sherali, Hanif D. 1952- |
| author_GND | (DE-588)13576856X (DE-588)138447896 (DE-588)135768586 |
| author_facet | Bazaraa, Mokhtar S. 1943- Jarvis, John J. 1941- Sherali, Hanif D. 1952- |
| author_role | aut aut aut |
| author_sort | Bazaraa, Mokhtar S. 1943- |
| author_variant | m s b ms msb j j j jj jjj h d s hd hds |
| building | Verbundindex |
| bvnumber | BV036068689 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.74 |
| callnumber-search | T57.74 |
| callnumber-sort | T 257.74 |
| callnumber-subject | T - General Technology |
| classification_rvk | SK 870 |
| ctrlnum | (OCoLC)419865390 (DE-599)GBV605528608 |
| dewey-full | 519.7/2 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.7/2 |
| dewey-search | 519.7/2 |
| dewey-sort | 3519.7 12 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 4. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02592nam a2200625 c 4500</leader><controlfield tag="001">BV036068689</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100908 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100309s2010 d||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009028769</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780470462720</subfield><subfield code="9">978-0-470-46272-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)419865390</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV605528608</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.74</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.7/2</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 870</subfield><subfield code="0">(DE-625)143265:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bazaraa, Mokhtar S.</subfield><subfield code="d">1943-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)13576856X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear programming and network flows</subfield><subfield code="c">Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">4. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, NJ</subfield><subfield code="b">Wiley</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 748 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Transportproblem</subfield><subfield code="0">(DE-588)4060694-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Transportproblem</subfield><subfield code="0">(DE-588)4060694-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Transportproblem</subfield><subfield code="0">(DE-588)4060694-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jarvis, John J.</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)138447896</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sherali, Hanif D.</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135768586</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018960002&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018960002</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV036068689 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T22:10:47Z |
| institution | BVB |
| isbn | 9780470462720 |
| language | English |
| lccn | 2009028769 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018960002 |
| oclc_num | 419865390 |
| open_access_boolean | |
| owner | DE-634 DE-20 DE-703 DE-M347 DE-384 DE-11 |
| owner_facet | DE-634 DE-20 DE-703 DE-M347 DE-384 DE-11 |
| physical | XIV, 748 S. graph. Darst. |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Wiley |
| record_format | marc |
| spelling | Bazaraa, Mokhtar S. 1943- Verfasser (DE-588)13576856X aut Linear programming and network flows Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali 4. ed. Hoboken, NJ Wiley 2010 XIV, 748 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references and index Linear programming Network analysis (Planning) Transportproblem (DE-588)4060694-6 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 s Netzwerkfluss (DE-588)4126130-6 s DE-604 Netzwerktheorie (DE-588)4171531-7 s Transportproblem (DE-588)4060694-6 s 1\p DE-604 Optimierung (DE-588)4043664-0 s 2\p DE-604 Jarvis, John J. 1941- Verfasser (DE-588)138447896 aut Sherali, Hanif D. 1952- Verfasser (DE-588)135768586 aut GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018960002&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Bazaraa, Mokhtar S. 1943- Jarvis, John J. 1941- Sherali, Hanif D. 1952- Linear programming and network flows Linear programming Network analysis (Planning) Transportproblem (DE-588)4060694-6 gnd Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd Netzwerkfluss (DE-588)4126130-6 gnd Netzwerktheorie (DE-588)4171531-7 gnd |
| subject_GND | (DE-588)4060694-6 (DE-588)4043664-0 (DE-588)4035816-1 (DE-588)4126130-6 (DE-588)4171531-7 |
| title | Linear programming and network flows |
| title_auth | Linear programming and network flows |
| title_exact_search | Linear programming and network flows |
| title_full | Linear programming and network flows Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali |
| title_fullStr | Linear programming and network flows Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali |
| title_full_unstemmed | Linear programming and network flows Mokhtar S. Bazaraa ; John J. Jarvis ; Hanif D. Sherali |
| title_short | Linear programming and network flows |
| title_sort | linear programming and network flows |
| topic | Linear programming Network analysis (Planning) Transportproblem (DE-588)4060694-6 gnd Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd Netzwerkfluss (DE-588)4126130-6 gnd Netzwerktheorie (DE-588)4171531-7 gnd |
| topic_facet | Linear programming Network analysis (Planning) Transportproblem Optimierung Lineare Optimierung Netzwerkfluss Netzwerktheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018960002&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bazaraamokhtars linearprogrammingandnetworkflows AT jarvisjohnj linearprogrammingandnetworkflows AT sheralihanifd linearprogrammingandnetworkflows |