Linear programming: foundations and extensions
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Boston [u.a.]
Kluwer Acad. Publ.
1996
|
Schriftenreihe: | International series in operations research & management science
|
Schlagworte: | |
Beschreibung: | XVIII, 418 S. Ill. |
ISBN: | 0792398041 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV011318836 | ||
003 | DE-604 | ||
005 | 19970924 | ||
007 | t | ||
008 | 970424s1996 a||| |||| 00||| eng d | ||
020 | |a 0792398041 |9 0-7923-9804-1 | ||
035 | |a (OCoLC)35723739 | ||
035 | |a (DE-599)BVBBV011318836 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-20 |a DE-703 |a DE-29T |a DE-11 | ||
050 | 0 | |a T57.74 | |
082 | 0 | |a 519.7 |2 21 | |
084 | |a SK 870 |0 (DE-625)143265: |2 rvk | ||
100 | 1 | |a Vanderbei, Robert J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Linear programming |b foundations and extensions |c Robert J. Vanderbei |
264 | 1 | |a Boston [u.a.] |b Kluwer Acad. Publ. |c 1996 | |
300 | |a XVIII, 418 S. |b Ill. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a International series in operations research & management science | |
650 | 7 | |a Lineaire programmering |2 gtt | |
650 | 7 | |a Optimisation mathématique |2 ram | |
650 | 7 | |a Problème du voyageur de commerce |2 ram | |
650 | 7 | |a Programacao linear |2 larpcal | |
650 | 7 | |a Programmation linéaire |2 ram | |
650 | 7 | |a Wiskundige methoden |2 gtt | |
650 | 7 | |a analyse convexe |2 inriac | |
650 | 7 | |a complémentarité |2 inriac | |
650 | 7 | |a flux réseau |2 inriac | |
650 | 7 | |a optimisation sous contrainte |2 inriac | |
650 | 7 | |a programmation dynamique |2 inriac | |
650 | 7 | |a programmation linéaire |2 inriac | |
650 | 7 | |a programmation quadratique |2 inriac | |
650 | 4 | |a Linear programming | |
650 | 4 | |a Mathematical optimization | |
650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |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 Innere-Punkte-Methode |0 (DE-588)4352322-5 |2 gnd |9 rswk-swf |
655 | 7 | |8 1\p |0 (DE-588)4151278-9 |a Einführung |2 gnd-content | |
689 | 0 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 0 | 1 | |a Innere-Punkte-Methode |0 (DE-588)4352322-5 |D s |
689 | 0 | |8 2\p |5 DE-604 | |
689 | 1 | 0 | |a Lineare Optimierung |0 (DE-588)4035816-1 |D s |
689 | 1 | 1 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
689 | 1 | |8 3\p |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007604262 | ||
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 | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804125826088697856 |
---|---|
any_adam_object | |
author | Vanderbei, Robert J. |
author_facet | Vanderbei, Robert J. |
author_role | aut |
author_sort | Vanderbei, Robert J. |
author_variant | r j v rj rjv |
building | Verbundindex |
bvnumber | BV011318836 |
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)35723739 (DE-599)BVBBV011318836 |
dewey-full | 519.7 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.7 |
dewey-search | 519.7 |
dewey-sort | 3519.7 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02412nam a2200637 c 4500</leader><controlfield tag="001">BV011318836</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970924 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970424s1996 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792398041</subfield><subfield code="9">0-7923-9804-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35723739</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011318836</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-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29T</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</subfield><subfield code="2">21</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">Vanderbei, Robert J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear programming</subfield><subfield code="b">foundations and extensions</subfield><subfield code="c">Robert J. Vanderbei</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer Acad. Publ.</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVIII, 418 S.</subfield><subfield code="b">Ill.</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="490" ind1="0" ind2=" "><subfield code="a">International series in operations research & management science</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Lineaire programmering</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimisation mathématique</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Problème du voyageur de commerce</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programacao linear</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation linéaire</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wiskundige methoden</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse convexe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complémentarité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">flux réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">optimisation sous contrainte</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation dynamique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation linéaire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">programmation quadratique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</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">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">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</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">Innere-Punkte-Methode</subfield><subfield code="0">(DE-588)4352322-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><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">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007604262</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\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> |
genre | 1\p (DE-588)4151278-9 Einführung gnd-content |
genre_facet | Einführung |
id | DE-604.BV011318836 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:07:43Z |
institution | BVB |
isbn | 0792398041 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007604262 |
oclc_num | 35723739 |
open_access_boolean | |
owner | DE-20 DE-703 DE-29T DE-11 |
owner_facet | DE-20 DE-703 DE-29T DE-11 |
physical | XVIII, 418 S. Ill. |
publishDate | 1996 |
publishDateSearch | 1996 |
publishDateSort | 1996 |
publisher | Kluwer Acad. Publ. |
record_format | marc |
series2 | International series in operations research & management science |
spelling | Vanderbei, Robert J. Verfasser aut Linear programming foundations and extensions Robert J. Vanderbei Boston [u.a.] Kluwer Acad. Publ. 1996 XVIII, 418 S. Ill. txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science Lineaire programmering gtt Optimisation mathématique ram Problème du voyageur de commerce ram Programacao linear larpcal Programmation linéaire ram Wiskundige methoden gtt analyse convexe inriac complémentarité inriac flux réseau inriac optimisation sous contrainte inriac programmation dynamique inriac programmation linéaire inriac programmation quadratique inriac Linear programming Mathematical optimization Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Lineare Optimierung (DE-588)4035816-1 gnd rswk-swf Innere-Punkte-Methode (DE-588)4352322-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Lineare Optimierung (DE-588)4035816-1 s Innere-Punkte-Methode (DE-588)4352322-5 s 2\p DE-604 Netzwerkfluss (DE-588)4126130-6 s 3\p DE-604 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 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Vanderbei, Robert J. Linear programming foundations and extensions Lineaire programmering gtt Optimisation mathématique ram Problème du voyageur de commerce ram Programacao linear larpcal Programmation linéaire ram Wiskundige methoden gtt analyse convexe inriac complémentarité inriac flux réseau inriac optimisation sous contrainte inriac programmation dynamique inriac programmation linéaire inriac programmation quadratique inriac Linear programming Mathematical optimization Netzwerkfluss (DE-588)4126130-6 gnd Lineare Optimierung (DE-588)4035816-1 gnd Innere-Punkte-Methode (DE-588)4352322-5 gnd |
subject_GND | (DE-588)4126130-6 (DE-588)4035816-1 (DE-588)4352322-5 (DE-588)4151278-9 |
title | Linear programming foundations and extensions |
title_auth | Linear programming foundations and extensions |
title_exact_search | Linear programming foundations and extensions |
title_full | Linear programming foundations and extensions Robert J. Vanderbei |
title_fullStr | Linear programming foundations and extensions Robert J. Vanderbei |
title_full_unstemmed | Linear programming foundations and extensions Robert J. Vanderbei |
title_short | Linear programming |
title_sort | linear programming foundations and extensions |
title_sub | foundations and extensions |
topic | Lineaire programmering gtt Optimisation mathématique ram Problème du voyageur de commerce ram Programacao linear larpcal Programmation linéaire ram Wiskundige methoden gtt analyse convexe inriac complémentarité inriac flux réseau inriac optimisation sous contrainte inriac programmation dynamique inriac programmation linéaire inriac programmation quadratique inriac Linear programming Mathematical optimization Netzwerkfluss (DE-588)4126130-6 gnd Lineare Optimierung (DE-588)4035816-1 gnd Innere-Punkte-Methode (DE-588)4352322-5 gnd |
topic_facet | Lineaire programmering Optimisation mathématique Problème du voyageur de commerce Programacao linear Programmation linéaire Wiskundige methoden analyse convexe complémentarité flux réseau optimisation sous contrainte programmation dynamique programmation linéaire programmation quadratique Linear programming Mathematical optimization Netzwerkfluss Lineare Optimierung Innere-Punkte-Methode Einführung |
work_keys_str_mv | AT vanderbeirobertj linearprogrammingfoundationsandextensions |