Linear programming and network flows:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
Wiley
1990
|
| Ausgabe: | 2. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 684 S. graph. Darst. |
| ISBN: | 0471636819 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV002751509 | ||
| 003 | DE-604 | ||
| 005 | 20100121 | ||
| 007 | t | ||
| 008 | 900710s1990 d||| |||| 00||| eng d | ||
| 020 | |a 0471636819 |9 0-471-63681-9 | ||
| 035 | |a (OCoLC)318453807 | ||
| 035 | |a (DE-599)BVBBV002751509 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-739 |a DE-Aug4 |a DE-384 |a DE-29T |a DE-20 |a DE-634 |a DE-83 |a DE-11 |a DE-188 |a DE-706 | ||
| 082 | 0 | |a 519.72 |b B191 |b 1990 | |
| 084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
| 084 | |a 90C05 |2 msc | ||
| 084 | |a 90B10 |2 msc | ||
| 084 | |a MAT 912f |2 stub | ||
| 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 2. ed. | ||
| 264 | 1 | |a New York |b Wiley |c 1990 | |
| 300 | |a XIV, 684 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Análisis de redes (Planificación) - Modelos matemáticos | |
| 650 | 4 | |a Optimización matemática | |
| 650 | 4 | |a Programación lineal | |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |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 |
| 689 | 0 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 0 | 1 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
| 689 | 0 | 2 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Optimierung |0 (DE-588)4043664-0 |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 Lineare Optimierung |0 (DE-588)4035816-1 |D s |
| 689 | 2 | 1 | |a Netzwerkfluss |0 (DE-588)4126130-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=001759090&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-001759090 | ||
| 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_ | 1804117104672112640 |
|---|---|
| adam_text | LINEAR PROGRAMMING AND NETWORK FLOWS SECOND EDITION MOKHTAR S. BAZARAA
SENIOR VICE PRESIDENT BURNHAM SERVICE CORPORATION JOHN J. JARVIS SCHOOL
OF INDUSTRIAL AND SYSTEMS ENGINEERING GEORGIA INSTITUTE OF TECHNOLOGY
HANIF D. SHERALI DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS
RESEARCH VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY WILEY JOHN
WILEY & SONS NEW YORK CHICHESTER BRISBANE TORONTO SINGAPORE CONTENTS 1.
INTRODUCTION 1 1.1 THE LINEAR PROGRAMMING PROBLEM 2 1.2 LINEAR
PROGRAMMING MODELING AND EXAMPLES 7 1.3 GEOMETRIE SOLUTION 14 1.4 THE
REQUIREMENT SPACE 19 1.5 NOTATION 24 EXERCISES 24 NOTES AND REFERENCES
37 2. LINEAR ALGEBRA, CONVEX ANALYSIS, AND POLYHEDRAL SETS 38 2.1
VECTORS 38 2.2 MATRICES 44 2.3 SIMULTANEOUS LINEAR EQUATIONS 53 2.4
CONVEX SETS AND CONVEX FUNCTIONS 55 2.5 POLYHEDRAL SETS AND POLYHEDRAL
CONES 61 2.6 EXTREME POINTS, FACES, DIRECTIONS, AND EXTREME DIRECTIONS
OF POLYHEDRAL SETS: GEOMETRIE INSIGHTS 63 2.7 REPRESENTATION OF
POLYHEDRAL SETS 67 EXERCISES 73 NOTES AND REFERENCES 80 3. THE SIMPLEX
METHOD 81 3.1 EXTREME POINTS AND OPTIMALITY 81 3.2 BASIC FEASIBLE
SOLUTIONS 84 3.3 KEY TO THE SIMPLEX METHOD 92 3.4 GEOMETRIE MOTIVATION
OF THE SIMPLEX METHOD 94 3.5 ALGEBRA OF THE SIMPLEX METHOD 97 3.6
TERMINATION: OPTIMALITY AND UNBOUNDEDNESS 103 3.7 THE SIMPLEX METHOD 108
3.8 THE SIMPLEX METHOD IN TABLEAU FORMAT 11 3 3.9 BLOCK PIVOTING 121
EXERCISES 122 NOTES AND REFERENCES 135 4. STARTING SOLUTION AND
CONVERGENCE 137 4.1 THE INITIAL BASIC FEASIBLE SOLUTION 137 4.2 THE
TWO-PHASE METHOD 141 4.3 THE BIG-AI METHOD 152 4.4 COMPARISON OF THE
TWO-PHASE AND THE BIG-AI METHODS: HOW BIG SHOULD BIG-AI BE ? 161 4.5 THE
SINGLE ARTIFICIAL VARIABLE TECHNIQUE 162 4.6 DEGENERACY, CYCLING, AND
STALLING 164 XI XII CONTENTS 4.7 VALIDATION OF THE TWO CYCLING
PREVENTION RULES 170 EXERCISES 175 NOTES AND REFERENCES 1 87 SPECIAL
SIMPLEX IMPLEMENTATIONS AND OPTIMALITY CONDITIONS 188 5.1 THE REVISED
SIMPLEX METHOD 1 88 5.2 THE SIMPLEX METHOD FOR BOUNDED VARIABLES 206 5.3
FARKAS LEMMA VIA THE SIMPLEX METHOD 219 5.4 THE KARUSH - KUHN - TUCKER
OPTIMALITY CONDITIONS 221 EXERCISES 227 NOTES AND REFERENCES 241 DUALITY
AND SENSITIVITY ANALYSIS 243 6.1 FORMULATION OF THE DUAL PROBLEM 243 6.2
PRIMAL-DUAL RELATIONSHIPS 249 6.3 ECONOMIC INTERPRETATION OF THE DUAL
254 6.4 THE DUAL SIMPLEX METHOD 261 6.5 THE PRIMAL-DUAL METHOD 269 6.6
FINDING AN INITIAL DUAL FEASIBLE SOLUTION: THE ARTIFICIAL CONSTRAINT
TECHNIQUE 276 6.7 SENSITIVITY ANALYSIS 278 6.8 PARAMETRIC ANALYSIS 294
EXERCISES 301 NOTES AND REFERENCES 319 THE DECOMPOSITION PRINCIPLE 320
7.1 THE DECOMPOSITION PRINCIPLE 321 7.2 NUMERICAL EXAMPLE 326 7.3
GETTING STARTED 334 7.4 THE CASE OF UNBOUNDED REGION X 335 7.5 BLOCK
DIAGONAL OR ANGULAR STRUCTURE 341 7.6 DUALITY AND RELATIONSHIPS WITH
OTHER DECOMPOSITION PROCEDURES 350 EXERCISES 355 NOTES AND REFERENCES
369 COMPLEXITY OF THE SIMPLEX ALGORITHM AND POLYNOM!AL ALGORITHMS 371
8.1 POLYNOMIAL COMPLEXITY ISSUES 371 8.2 COMPUTATIONAL COMPLEXITY OF THE
SIMPLEX ALGORITHM 375 8.3 KHACHIAN S ELLIPSOID ALGORITHM 379 8.4
KARMARKAR S PROJECTIVE ALGORITHM 380 CONTENTS XIII 8.5 ANALYSIS OF
KARMARKAR S ALGORITHM: CONVERGENCE, COMPLEXITY, SLIDING OBJECTIVE
METHOD, AND BASIC OPTIMAL SOLUTIONS 394 EXERCISES 404 NOTES AND
REFERENCES 416 9. MINIMAL COST NETWORK FLOWS 419 9.1 THE MINIMAL COST
NETWORK FLOW PROBLEM 420 9.2 SOME BASIC DEFINITIONS AND TERMINOLOGY FROM
GRAPH THEORY 421 9.3 PROPERTIES OF THE A MATRIX 425 9.4 REPRESENTATION
OF A NONBASIC VECTOR IN TERMS OF THE BASIC VECTORS 430 9.5 THE SIMPLEX
METHOD FOR NETWORK FLOW PROBLEMS 432 9.6 AN EXAMPLE OF THE NETWORK
SIMPLEX METHOD 440 9.7 FINDING AN INITIAL BASIC FEASIBLE SOLUTION 440
9.8 NETWORK FLOWS WITH LOWER AND UPPER BOUNDS 443 9.9 THE SIMPLEX
TABLEAU ASSOCIATED WITH A NETWORK FLOW PROBLEM 446 9.10 LIST STRUCTURES
FOR IMPLEMENTING THE NETWORK SIMPLEX ALGORITHM 446 9.11 DEGENERACY,
CYCLING, AND STALLING 452 9.12 GENERALIZED NETWORK PROBLEMS 458
EXERCISES 461 NOTES AND REFERENCES 475 10. THE TRANSPORTATION AND
ASSIGNMENT PROBLEMS 477 10.1 DEFINITION OF THE TRANSPORTATION PROBLEM
478 10.2 PROPERTIES OF THE A MATRIX 481 10.3 REPRESENTATION OF A
NONBASIC VECTOR IN TERMS OF THE BASIC VECTORS 484 10.4 THE SIMPLEX
METHOD FOR TRANSPORTATION PROBLEMS 486 10.5 ILLUSTRATIVE EXAMPLES AND A
NOTE ON DEGENERACY 492 10.6 THE SIMPLEX TABLEAU ASSOCIATED WITH A
TRANSPORTATION TABLEAU 498 10.7 THE ASSIGNMENT PROBLEM: (KUHN S)
HUNGARIAN ALGORITHM 499 10.8 ALTERNATING BASIS ALGORITHM FOR ASSIGNMENT
PROBLEMS 508 10.9 A POLYNOMIAL SUCCESSIVE SHORTEST PATH APPROACH FOR
ASSIGNMENT PROBLEMS 510 10.10 THE TRANSSHIPMENT PROBLEM 513 EXERCISES
514 NOTES AND REFERENCES 526 XIV CONTENTS 11. THE OUT-OF-KILTER
ALGORITHM 528 11.1 THE OUT-OF-KILTER FORMULATION OF A MINIMAL COST
NETWORK FLOW PROBLEM 528 11.2 STRATEGY OF THE OUT-OF-KILTER ALGORITHM
534 11.3 SUMMARY OF THE OUT-OF-KILTER ALGORITHM 546 11.4 AN EXAMPLE OF
THE OUT-OF-KILTER ALGORITHM 547 11.5 A LABELING PROCEDURE FOR THE
OUT-OF-KILTER ALGORITHM 548 11.6 INSIGHT INTO CHANGES IN PRIMAL AND DUAL
FUNCTION VALUES 550 EXERCISES 552 NOTES AND REFERENCES 561 12. MAXIMAL
FLOW, SHORTEST PATH, MULTICOMMODITY FLOW, AND NETWORK SYNTHESIS PROBLEMS
563 12.1 THE MAXIMAL FLOW PROBLEM 563 12.2 THE SHORTEST PATH PROBLEM 572
12.3 POLYNOMIAL SHORTEST PATH ALGORITHMS FOR NETWORKS WITH ARBITRARY
COSTS 584 12.4 MULTICOMMODITY FLOWS 587 12.5 CHARACTERIZATION OF A BASIS
FOR THE MULTICOMMODITY MINIMAL COST FLOW PROBLEM 596 12.6 SYNTHESIS OF
MULTITERMINAL FLOW NETWORKS 601 EXERCISES 609 NOTES AND REFERENCES 625
BIBLIOGRAPHY 626 INDEX 673
|
| 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 | BV002751509 |
| classification_rvk | SK 870 |
| classification_tum | MAT 912f |
| ctrlnum | (OCoLC)318453807 (DE-599)BVBBV002751509 |
| dewey-full | 519.72 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.72 |
| dewey-search | 519.72 |
| dewey-sort | 3519.72 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02600nam a2200613 c 4500</leader><controlfield tag="001">BV002751509</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100121 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900710s1990 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0471636819</subfield><subfield code="9">0-471-63681-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)318453807</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV002751509</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.72</subfield><subfield code="b">B191</subfield><subfield code="b">1990</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="084" ind1=" " ind2=" "><subfield code="a">90C05</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90B10</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 912f</subfield><subfield code="2">stub</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">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Wiley</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 684 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="650" ind1=" " ind2="4"><subfield code="a">Análisis de redes (Planificación) - Modelos matemáticos</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimización matemática</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programación lineal</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">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">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</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="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">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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">Lineare Optimierung</subfield><subfield code="0">(DE-588)4035816-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" 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="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=001759090&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-001759090</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.BV002751509 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:49:06Z |
| institution | BVB |
| isbn | 0471636819 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-001759090 |
| oclc_num | 318453807 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-739 DE-Aug4 DE-384 DE-29T DE-20 DE-634 DE-83 DE-11 DE-188 DE-706 |
| owner_facet | DE-91 DE-BY-TUM DE-739 DE-Aug4 DE-384 DE-29T DE-20 DE-634 DE-83 DE-11 DE-188 DE-706 |
| physical | XIV, 684 S. graph. Darst. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| 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 2. ed. New York Wiley 1990 XIV, 684 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Análisis de redes (Planificación) - Modelos matemáticos Optimización matemática Programación lineal Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Transportproblem (DE-588)4060694-6 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 s Netzwerktheorie (DE-588)4171531-7 s Transportproblem (DE-588)4060694-6 s DE-604 Optimierung (DE-588)4043664-0 s 1\p DE-604 Netzwerkfluss (DE-588)4126130-6 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=001759090&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 Análisis de redes (Planificación) - Modelos matemáticos Optimización matemática Programación lineal Netzwerkfluss (DE-588)4126130-6 gnd Transportproblem (DE-588)4060694-6 gnd Netzwerktheorie (DE-588)4171531-7 gnd Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd |
| subject_GND | (DE-588)4126130-6 (DE-588)4060694-6 (DE-588)4171531-7 (DE-588)4043664-0 (DE-588)4035816-1 |
| 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 | Análisis de redes (Planificación) - Modelos matemáticos Optimización matemática Programación lineal Netzwerkfluss (DE-588)4126130-6 gnd Transportproblem (DE-588)4060694-6 gnd Netzwerktheorie (DE-588)4171531-7 gnd Optimierung (DE-588)4043664-0 gnd Lineare Optimierung (DE-588)4035816-1 gnd |
| topic_facet | Análisis de redes (Planificación) - Modelos matemáticos Optimización matemática Programación lineal Netzwerkfluss Transportproblem Netzwerktheorie Optimierung Lineare Optimierung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001759090&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 |