Solving large scale real world minimum cost flow problems by a network simplex method:
Abstract: "This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisons [sic]. The real-world test sets include minimum-cost flow problems that...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
1996
|
| Schriftenreihe: | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC
1996,7 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisons [sic]. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with RELAX-IV, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT." |
| Beschreibung: | 27 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010774575 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960529s1996 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)37274192 | ||
| 035 | |a (DE-599)BVBBV010774575 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-703 | ||
| 084 | |a SS 4777 |0 (DE-625)143522: |2 rvk | ||
| 100 | 1 | |a Löbel, Andreas |d 1967- |e Verfasser |0 (DE-588)120072386 |4 aut | |
| 245 | 1 | 0 | |a Solving large scale real world minimum cost flow problems by a network simplex method |c Andreas Löbel |
| 264 | 1 | |a Berlin |c 1996 | |
| 300 | |a 27 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1996,7 | |
| 520 | 3 | |a Abstract: "This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisons [sic]. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with RELAX-IV, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT." | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Programming (Mathematics) | |
| 830 | 0 | |a Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |v 1996,7 |w (DE-604)BV004801715 |9 1996,7 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007195655 | ||
Datensatz im Suchindex
| _version_ | 1804125255467270145 |
|---|---|
| any_adam_object | |
| author | Löbel, Andreas 1967- |
| author_GND | (DE-588)120072386 |
| author_facet | Löbel, Andreas 1967- |
| author_role | aut |
| author_sort | Löbel, Andreas 1967- |
| author_variant | a l al |
| building | Verbundindex |
| bvnumber | BV010774575 |
| classification_rvk | SS 4777 |
| ctrlnum | (OCoLC)37274192 (DE-599)BVBBV010774575 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01895nam a2200337 cb4500</leader><controlfield tag="001">BV010774575</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960529s1996 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37274192</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010774575</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-12</subfield><subfield code="a">DE-703</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4777</subfield><subfield code="0">(DE-625)143522:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Löbel, Andreas</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)120072386</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Solving large scale real world minimum cost flow problems by a network simplex method</subfield><subfield code="c">Andreas Löbel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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="490" ind1="1" ind2=" "><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1996,7</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisons [sic]. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with RELAX-IV, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC</subfield><subfield code="v">1996,7</subfield><subfield code="w">(DE-604)BV004801715</subfield><subfield code="9">1996,7</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007195655</subfield></datafield></record></collection> |
| id | DE-604.BV010774575 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:58:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007195655 |
| oclc_num | 37274192 |
| open_access_boolean | |
| owner | DE-12 DE-703 |
| owner_facet | DE-12 DE-703 |
| physical | 27 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| series2 | Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC |
| spelling | Löbel, Andreas 1967- Verfasser (DE-588)120072386 aut Solving large scale real world minimum cost flow problems by a network simplex method Andreas Löbel Berlin 1996 27 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1996,7 Abstract: "This paper presents a large-scale real-world application of the minimum-cost flow problem, describes some details of a new implementation of the network simplex algorithm, and reports on computational comparisons [sic]. The real-world test sets include minimum-cost flow problems that are based on single-depot vehicle scheduling problems and on a Lagrangean relaxation of multiple-depot vehicle scheduling problems. Some of the problems are extremely large with up to 42,000 nodes and 20,000,000 arcs. The standard test problems are generated with NETGEN and include parts of the DIMACS standard problems. Our network simplex code is compared with RELAX-IV, Cost Scaling 2 version 3.4, and CPLEX's network solver NETOPT." Mathematical optimization Network analysis (Planning) Operations research Programming (Mathematics) Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC 1996,7 (DE-604)BV004801715 1996,7 |
| spellingShingle | Löbel, Andreas 1967- Solving large scale real world minimum cost flow problems by a network simplex method Konrad-Zuse-Zentrum für Informationstechnik <Berlin>: Preprint SC Mathematical optimization Network analysis (Planning) Operations research Programming (Mathematics) |
| title | Solving large scale real world minimum cost flow problems by a network simplex method |
| title_auth | Solving large scale real world minimum cost flow problems by a network simplex method |
| title_exact_search | Solving large scale real world minimum cost flow problems by a network simplex method |
| title_full | Solving large scale real world minimum cost flow problems by a network simplex method Andreas Löbel |
| title_fullStr | Solving large scale real world minimum cost flow problems by a network simplex method Andreas Löbel |
| title_full_unstemmed | Solving large scale real world minimum cost flow problems by a network simplex method Andreas Löbel |
| title_short | Solving large scale real world minimum cost flow problems by a network simplex method |
| title_sort | solving large scale real world minimum cost flow problems by a network simplex method |
| topic | Mathematical optimization Network analysis (Planning) Operations research Programming (Mathematics) |
| topic_facet | Mathematical optimization Network analysis (Planning) Operations research Programming (Mathematics) |
| volume_link | (DE-604)BV004801715 |
| work_keys_str_mv | AT lobelandreas solvinglargescalerealworldminimumcostflowproblemsbyanetworksimplexmethod |