| Record ID | marc_columbia/Columbia-extract-20221130-007.mrc:304318709:2906 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-007.mrc:304318709:2906?format=raw |
LEADER: 02906fam a22004094a 4500
001 3303985
005 20221020033538.0
008 010926t20022002njuab b 100 0 eng
010 $a 2001046899
020 $a9810248024
035 $a(OCoLC)48056290
035 $a(OCoLC)ocm48056290
035 $9AUU3284CU
035 $a(NNC)3303985
035 $a3303985
040 $aDLC$cDLC$dDLC$dOrLoB-B
042 $apcc
050 00 $aQA402.5$b.C5435 2002
082 00 $a511/.6$221
245 00 $aCombinatorial and global optimization /$ceditors, Panos M. Pardalos, Athanasios Migdalas, Rainer E. Burkard.
260 $aRiver Edge, NJ :$bWorld Scientific,$c[2002], ©2002.
300 $axvi, 355 pages :$billustrations, maps ;$c23 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aSeries on applied mathematics ;$vvol. 14
504 $aIncludes bibliographical references.
520 1 $a"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.
520 8 $aRecent 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.
520 8 $aThis volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece." "Readership: Researchers in numerical & computational mathematics, optimization, combinatorics & graph theory, networking and materials engineering."--BOOK JACKET.
650 0 $aCombinatorial optimization$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2009120720
650 0 $aMathematical optimization$vCongresses.$0http://id.loc.gov/authorities/subjects/sh2008107548
650 0 $aNonlinear programming$vCongresses.
700 1 $aPardalos, P. M.$q(Panos M.),$d1954-$0http://id.loc.gov/authorities/names/n87923409
700 1 $aMigdalas, Athanasios.$0http://id.loc.gov/authorities/names/n97035780
700 1 $aBurkard, Rainer E.$0http://id.loc.gov/authorities/names/n80162591
830 0 $aSeries on applied mathematics ;$vv. 14.$0http://id.loc.gov/authorities/names/n93008796
852 00 $boff,eng$hQA402.5$i.C5435 2002