Fast approximation algorithms for fractional packing and covering problems:
Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniq...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1419 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxation-based algorithm We give several applications of our algorithms. The new approach yields several orders of magnitude of improvement over the best previously known running times for the scheduling of unrelated parallel machines in both the preemptive and the non-preemptive models, for the job shop problem, for the cutting-stock problem, and for the minimum-cost multicommodity flow problem. |
| Beschreibung: | 52 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993733 | ||
| 003 | DE-604 | ||
| 005 | 20160613 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28348119 | ||
| 035 | |a (DE-599)BVBBV008993733 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Fast approximation algorithms for fractional packing and covering problems |c S. Plotkin ; D. Schmoys ; E. Tardos |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 52 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1419 | |
| 520 | 3 | |a Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxation-based algorithm | |
| 520 | 3 | |a We give several applications of our algorithms. The new approach yields several orders of magnitude of improvement over the best previously known running times for the scheduling of unrelated parallel machines in both the preemptive and the non-preemptive models, for the job shop problem, for the cutting-stock problem, and for the minimum-cost multicommodity flow problem. | |
| 650 | 4 | |a Approximation theory | |
| 650 | 4 | |a Operations research | |
| 700 | 1 | |a Schmoys, David B. |e Verfasser |4 aut | |
| 700 | 1 | |a Tardos, Éva |d 1957- |e Verfasser |0 (DE-588)140445382 |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1419 |w (DE-604)BV008928280 |9 1419 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005942458 | ||
Datensatz im Suchindex
| _version_ | 1804123336314191872 |
|---|---|
| any_adam_object | |
| author | Plotkin, Serge A. Schmoys, David B. Tardos, Éva 1957- |
| author_GND | (DE-588)140445382 |
| author_facet | Plotkin, Serge A. Schmoys, David B. Tardos, Éva 1957- |
| author_role | aut aut aut |
| author_sort | Plotkin, Serge A. |
| author_variant | s a p sa sap d b s db dbs é t ét |
| building | Verbundindex |
| bvnumber | BV008993733 |
| ctrlnum | (OCoLC)28348119 (DE-599)BVBBV008993733 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02210nam a2200337 cb4500</leader><controlfield tag="001">BV008993733</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160613 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28348119</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993733</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fast approximation algorithms for fractional packing and covering problems</subfield><subfield code="c">S. Plotkin ; D. Schmoys ; E. Tardos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">52 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="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1419</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxation-based algorithm</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We give several applications of our algorithms. The new approach yields several orders of magnitude of improvement over the best previously known running times for the scheduling of unrelated parallel machines in both the preemptive and the non-preemptive models, for the job shop problem, for the cutting-stock problem, and for the minimum-cost multicommodity flow problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schmoys, David B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tardos, Éva</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140445382</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1419</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1419</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942458</subfield></datafield></record></collection> |
| id | DE-604.BV008993733 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942458 |
| oclc_num | 28348119 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 52 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Plotkin, Serge A. Verfasser aut Fast approximation algorithms for fractional packing and covering problems S. Plotkin ; D. Schmoys ; E. Tardos Stanford, Calif. 1992 52 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1419 Abstract: "This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed in this paper greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems [23, 15, 18]. Our algorithm is a Lagrangean relaxation technique; an important aspect of our results is that we obtain a theoretical analysis of the running time of a Lagrangean relaxation-based algorithm We give several applications of our algorithms. The new approach yields several orders of magnitude of improvement over the best previously known running times for the scheduling of unrelated parallel machines in both the preemptive and the non-preemptive models, for the job shop problem, for the cutting-stock problem, and for the minimum-cost multicommodity flow problem. Approximation theory Operations research Schmoys, David B. Verfasser aut Tardos, Éva 1957- Verfasser (DE-588)140445382 aut Computer Science Department: Report STAN CS Stanford University 1419 (DE-604)BV008928280 1419 |
| spellingShingle | Plotkin, Serge A. Schmoys, David B. Tardos, Éva 1957- Fast approximation algorithms for fractional packing and covering problems Approximation theory Operations research |
| title | Fast approximation algorithms for fractional packing and covering problems |
| title_auth | Fast approximation algorithms for fractional packing and covering problems |
| title_exact_search | Fast approximation algorithms for fractional packing and covering problems |
| title_full | Fast approximation algorithms for fractional packing and covering problems S. Plotkin ; D. Schmoys ; E. Tardos |
| title_fullStr | Fast approximation algorithms for fractional packing and covering problems S. Plotkin ; D. Schmoys ; E. Tardos |
| title_full_unstemmed | Fast approximation algorithms for fractional packing and covering problems S. Plotkin ; D. Schmoys ; E. Tardos |
| title_short | Fast approximation algorithms for fractional packing and covering problems |
| title_sort | fast approximation algorithms for fractional packing and covering problems |
| topic | Approximation theory Operations research |
| topic_facet | Approximation theory Operations research |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT plotkinsergea fastapproximationalgorithmsforfractionalpackingandcoveringproblems AT schmoysdavidb fastapproximationalgorithmsforfractionalpackingandcoveringproblems AT tardoseva fastapproximationalgorithmsforfractionalpackingandcoveringproblems |