WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/903466532

Analysis and design of algorithms for combinatorial problems

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computi.

Open All Close All

type

about

http://schema.org/about

contributor

creator

description

http://schema.org/description

  • "Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computi."@en
  • "Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems."@en
  • "Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems."

editor

genre

http://schema.org/genre

  • "Llibres electrònics"
  • "Electronic books"@en
  • "Electronic books"
  • "Aufsatzsammlung"
  • "Electronic resource"@en
  • "Kongress"

name

http://schema.org/name

  • "Analysis and design of algorithms for combinatorial problems (a selected collection of papers based on the workshop, Udine, September 1982)"
  • "Analysis and design of algorithms for combinatorial problems"
  • "Analysis and design of algorithms for combinatorial problems"@en
  • "Analysis and Design of Algorithms for Combinatorial Problems. North-Holland Mathematics Studies, Volume 109 Annals of Discrete Mathematics, Volume 25"@en
  • "Analysis and design of algorithms for combinatorial problems "Sponsored by the Institute for System Analysis and Informatics of the Italian National Research Council (IASI-CNR).". - A selected collection of papers based on the workshop held at the International Centre for Mechanical Sciences (CISM) in Udine, Italy, in Sept. 1982"
  • "Analysis and design of algoritms for combinatorial problems"
  • "Analysis and Design of Algorithms for Combinatorial Problems"@en
  • "Analysis and design of algorithms for combinatorial problems : [a selected collection of papers based on the workshop held at the Internat. Centre for Mechan. Sciences in Udine, Italy, in Sept. 1982]"

workExample