Combinatorial And Global Optimization

Saved in:

Bibliographic Details
Title:	Combinatorial And Global Optimization
Description:	Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on “Combinatorial and Global Optimization” held at Crete, Greece.
Authors:	Rainer E Burkard, Athanasios Migdalas, Panos M Pardalos
Resource Type:	eBook.
Subjects:	Combinatorial optimization--Congresses, Mathematical optimization--Congresses, Nonlinear programming--Congresses
Categories:	MATHEMATICS / Combinatorics, MATHEMATICS / Applied, MATHEMATICS / Counting & Numeration
Database:	eBook Collection (EBSCOhost)

FullText	Links: – Type: ebook-pdf Text: Availability: 0
Header	DbId: nlebk DbLabel: eBook Collection (EBSCOhost) An: 210695 RelevancyScore: 979 AccessLevel: 6 PubType: eBook PubTypeId: ebook PreciseRelevancyScore: 978.796813964844
IllustrationInfo
ImageInfo	– Size: thumb Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$210695$PDF&s=r – Size: medium Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$210695$PDF&s=d
Items	– Name: Title Label: Title Group: Ti Data: Combinatorial And Global Optimization – Name: Abstract Label: Description Group: Ab Data: Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on “Combinatorial and Global Optimization” held at Crete, Greece. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Rainer+E+Burkard%22">Rainer E Burkard</searchLink><br /><searchLink fieldCode="AR" term="%22Athanasios+Migdalas%22">Athanasios Migdalas</searchLink><br /><searchLink fieldCode="AR" term="%22Panos+M+Pardalos%22">Panos M Pardalos</searchLink> – Name: TypePub Label: Resource Type Group: TypPub Data: eBook. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Combinatorial+optimization--Congresses%22">Combinatorial optimization--Congresses</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization--Congresses%22">Mathematical optimization--Congresses</searchLink><br /><searchLink fieldCode="DE" term="%22Nonlinear+programming--Congresses%22">Nonlinear programming--Congresses</searchLink> – Name: SubjectBISAC Label: Categories Group: Su Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Combinatorics%22">MATHEMATICS / Combinatorics</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Applied%22">MATHEMATICS / Applied</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Counting+%26+Numeration%22">MATHEMATICS / Counting & Numeration</searchLink>
PLink	https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=210695
RecordInfo	BibRecord: BibEntity: Classifications: – Code: 511.6 Scheme: ddc Type: prePub Languages: – Code: eng Text: English Subjects: – SubjectFull: Combinatorial optimization--Congresses Type: general – SubjectFull: Mathematical optimization--Congresses Type: general – SubjectFull: Nonlinear programming--Congresses Type: general Titles: – TitleFull: Combinatorial And Global Optimization Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Rainer E Burkard – PersonEntity: Name: NameFull: Athanasios Migdalas – PersonEntity: Name: NameFull: Panos M Pardalos – PersonEntity: Name: NameFull: Rainer E Burkard – PersonEntity: Name: NameFull: Athanasios Migdalas – PersonEntity: Name: NameFull: Panos M Pardalos IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2002 – D: 04 M: 02 Type: profile Y: 2014 Identifiers: – Type: isbn-print Value: 9789810248024 – Type: isbn-electronic Value: 9789812778215 Numbering: – Type: volume Value: 00014 Titles: – TitleFull: Combinatorial And Global Optimization Type: main
ResultId	1