A mixed-integer linear programming problem which is efficiently solvable:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Massachusetts Inst. of Technology, Laboratory for Computer Science
1985
|
| Schlagworte: | |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021896038 | ||
| 003 | DE-604 | ||
| 005 | 20040301000000.0 | ||
| 007 | t | ||
| 008 | 910225s1985 |||| 00||| eng d | ||
| 035 | |a (OCoLC)17002429 | ||
| 035 | |a (DE-599)BVBBV021896038 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT LCS TM 284 | ||
| 100 | 1 | |a Leiserson, Charles E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A mixed-integer linear programming problem which is efficiently solvable |c Charles E. Leiserson ; James B. Saxe |
| 264 | 1 | |a Cambridge, Mass. |b Massachusetts Inst. of Technology, Laboratory for Computer Science |c 1985 | |
| 300 | |a 11 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Linear programming |x Data processing | |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 3 | |5 DE-604 | |
| 700 | 1 | |a Saxe, James B. |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015111223 | ||
Datensatz im Suchindex
| _version_ | 1804135840699383808 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Leiserson, Charles E. Saxe, James B. |
| author_facet | Leiserson, Charles E. Saxe, James B. |
| author_role | aut aut |
| author_sort | Leiserson, Charles E. |
| author_variant | c e l ce cel j b s jb jbs |
| building | Verbundindex |
| bvnumber | BV021896038 |
| ctrlnum | (OCoLC)17002429 (DE-599)BVBBV021896038 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01583nam a2200457zc 4500</leader><controlfield tag="001">BV021896038</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910225s1985 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)17002429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021896038</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT LCS TM 284</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leiserson, Charles E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A mixed-integer linear programming problem which is efficiently solvable</subfield><subfield code="c">Charles E. Leiserson ; James B. Saxe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Massachusetts Inst. of Technology, Laboratory for Computer Science</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 S.</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">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saxe, James B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015111223</subfield></datafield></record></collection> |
| id | DE-604.BV021896038 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:04:23Z |
| indexdate | 2024-07-09T20:46:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015111223 |
| oclc_num | 17002429 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 11 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| publisher | Massachusetts Inst. of Technology, Laboratory for Computer Science |
| record_format | marc |
| spelling | Leiserson, Charles E. Verfasser aut A mixed-integer linear programming problem which is efficiently solvable Charles E. Leiserson ; James B. Saxe Cambridge, Mass. Massachusetts Inst. of Technology, Laboratory for Computer Science 1985 11 S. txt rdacontent n rdamedia nc rdacarrier Datenverarbeitung Combinatorial optimization Graph theory Linear programming Data processing Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Graph (DE-588)4021842-9 s Kombinatorische Optimierung (DE-588)4031826-6 s Kürzester-Weg-Problem (DE-588)4138403-9 s Saxe, James B. Verfasser aut |
| spellingShingle | Leiserson, Charles E. Saxe, James B. A mixed-integer linear programming problem which is efficiently solvable Datenverarbeitung Combinatorial optimization Graph theory Linear programming Data processing Kombinatorische Optimierung (DE-588)4031826-6 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| subject_GND | (DE-588)4031826-6 (DE-588)4021842-9 (DE-588)4001183-5 (DE-588)4138403-9 |
| title | A mixed-integer linear programming problem which is efficiently solvable |
| title_auth | A mixed-integer linear programming problem which is efficiently solvable |
| title_exact_search | A mixed-integer linear programming problem which is efficiently solvable |
| title_exact_search_txtP | A mixed-integer linear programming problem which is efficiently solvable |
| title_full | A mixed-integer linear programming problem which is efficiently solvable Charles E. Leiserson ; James B. Saxe |
| title_fullStr | A mixed-integer linear programming problem which is efficiently solvable Charles E. Leiserson ; James B. Saxe |
| title_full_unstemmed | A mixed-integer linear programming problem which is efficiently solvable Charles E. Leiserson ; James B. Saxe |
| title_short | A mixed-integer linear programming problem which is efficiently solvable |
| title_sort | a mixed integer linear programming problem which is efficiently solvable |
| topic | Datenverarbeitung Combinatorial optimization Graph theory Linear programming Data processing Kombinatorische Optimierung (DE-588)4031826-6 gnd Graph (DE-588)4021842-9 gnd Algorithmus (DE-588)4001183-5 gnd Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| topic_facet | Datenverarbeitung Combinatorial optimization Graph theory Linear programming Data processing Kombinatorische Optimierung Graph Algorithmus Kürzester-Weg-Problem |
| work_keys_str_mv | AT leisersoncharlese amixedintegerlinearprogrammingproblemwhichisefficientlysolvable AT saxejamesb amixedintegerlinearprogrammingproblemwhichisefficientlysolvable |