Data Portal @ linkeddatafragments.org

Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008042792/catalog> ?p ?o. }

• catalog alternative "Works. Selections. 1999".
• catalog contributor b11165019.
• catalog contributor b11165020.
• catalog created "c1999.".
• catalog date "1999".
• catalog date "c1999.".
• catalog dateCopyrighted "c1999.".
• catalog description ""Publications of Eugene L. Lawler:" p. 1-10.".
• catalog description "Includes bibliographical references.".
• catalog description "The use of parenthesis-free notation for the automatic design of switching circuits / G. A. Salton -- The quadratic assignment problem -- An approach to multilevel Boolean minimization -- Branch-and-bound methods: a survey / D. E. Wood -- A method for solving discrete optimization problems / M. D. Bell -- Optimal cycles in doubly weighted directed linear graphs -- A functional equation and its application to resource allocation and sequencing problems / J. M. Moore -- A solvable case of the traveling salesman problem -- Optimal sequencing of a single machine subject to precedence constraints -- Matroid intersection algorithms -- A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness -- On preemptive scheduling of unrelated parallel processors by linear programming / J. Labetoulle -- Sequencing jobs to minimize total weighted completion time subject to precedence constraints -- Fast approximation algorithms for knapsack problems -- Efficient implementation of dynamic programming algorithms for sequencing problems -- The great mathematical Sputnik of 1979 -- Flow network formulations of polymatroid optimization problems / C. U. Martel -- Computing maximal "polymatroidal" network flows / C. U. Martel -- At play in the fields of scheduling theory / J. K. Lenstra and A. H. G. Rinnooy Kan -- A faster algorithm for finding edge-disjoint branchings / P. Tong -- Preemptive scheduling of uniform machines subject to release dates / J. Labetoulle, J. K. Lenstra and A. H. G. Rinnooy Kan -- Linear-time computation of optimal subgraphs of decomposable graphs / M. W. Bern and A. L. Wong -- Old stories -- Sublinear approximate string matching and biological applications / W. I. Chang -- Approximation algorithms for multiple sequence alignment / V. Bafna and P. A. Pevzner -- "If a thing is not worth doing, it is not worth doing right"; commencement address to the Computer Science Majors, College of Letters & Sciences, UC Berkeley, May 1994.".
• catalog extent "ix, 318 :".
• catalog hasFormat "Selected publications of Eugene L. Lawler.".
• catalog identifier "9061964849".
• catalog isFormatOf "Selected publications of Eugene L. Lawler.".
• catalog isPartOf "CWI tract ; 126".
• catalog issued "1999".
• catalog issued "c1999.".
• catalog language "eng".
• catalog publisher "Amsterdam, The Netherlands : CWI,".
• catalog relation "Selected publications of Eugene L. Lawler.".
• catalog subject "Algorithms.".
• catalog subject "Combinatorial optimization.".
• catalog subject "Computational complexity.".
• catalog subject "Lawler, Eugene L.".
• catalog subject "QA402.5 .L395 1999".
• catalog tableOfContents "The use of parenthesis-free notation for the automatic design of switching circuits / G. A. Salton -- The quadratic assignment problem -- An approach to multilevel Boolean minimization -- Branch-and-bound methods: a survey / D. E. Wood -- A method for solving discrete optimization problems / M. D. Bell -- Optimal cycles in doubly weighted directed linear graphs -- A functional equation and its application to resource allocation and sequencing problems / J. M. Moore -- A solvable case of the traveling salesman problem -- Optimal sequencing of a single machine subject to precedence constraints -- Matroid intersection algorithms -- A "pseudopolynomial" algorithm for sequencing jobs to minimize total tardiness -- On preemptive scheduling of unrelated parallel processors by linear programming / J. Labetoulle -- Sequencing jobs to minimize total weighted completion time subject to precedence constraints -- Fast approximation algorithms for knapsack problems -- Efficient implementation of dynamic programming algorithms for sequencing problems -- The great mathematical Sputnik of 1979 -- Flow network formulations of polymatroid optimization problems / C. U. Martel -- Computing maximal "polymatroidal" network flows / C. U. Martel -- At play in the fields of scheduling theory / J. K. Lenstra and A. H. G. Rinnooy Kan -- A faster algorithm for finding edge-disjoint branchings / P. Tong -- Preemptive scheduling of uniform machines subject to release dates / J. Labetoulle, J. K. Lenstra and A. H. G. Rinnooy Kan -- Linear-time computation of optimal subgraphs of decomposable graphs / M. W. Bern and A. L. Wong -- Old stories -- Sublinear approximate string matching and biological applications / W. I. Chang -- Approximation algorithms for multiple sequence alignment / V. Bafna and P. A. Pevzner -- "If a thing is not worth doing, it is not worth doing right"; commencement address to the Computer Science Majors, College of Letters & Sciences, UC Berkeley, May 1994.".
• catalog title "Selected publications of Eugene L. Lawler / edited by K. Aardal ... [et al.].".
• catalog title "Works. Selections. 1999".
• catalog type "text".