04155nam 22006974a 450 991081974750332120240404142937.0981-277-821-7(CKB)1000000000398723(EBL)1679522(OCoLC)879023707(SSID)ssj0000125228(PQKBManifestationID)11135986(PQKBTitleCode)TC0000125228(PQKBWorkID)10026378(PQKB)10688706(MiAaPQ)EBC1679522(WSP)00004856(Au-PeEL)EBL1679522(CaPaEBR)ebr10201288(CaONFJC)MIL505444(EXLCZ)99100000000039872320010926d2002 uy 0engurcn|||||||||txtccrCombinatorial and global optimization /editors, Panos M. Pardalos, Athanasios Migdalas, Rainer E. Burkard1st ed.River Edge, NJ World Scientificc20021 online resource (373 p.)Series on applied mathematics ;vol. 14Description based upon print version of record.981-02-4802-4 Includes bibliographical references.Contents; Preface; A Forest Exterior Point Algorithm for Assignment Problems; 1 Introduction; 2 Preliminaries; 3 Description of the algorithm; 4 Correctness and complexity of the algorithm; 5 Concluding remarks; ReferencesA Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization 1 Introduction; 2 Genetic scatter search and tabu search approach; 3 HSGT algorithm description; 4 Weight computations; 5 Computational results; 6 Conclusions and recommendationsAppendix A: Test functions References; Exact Rates of Prokhorov Convergence under Three Moment Conditions; 1 Main result; 2 Outline of proof; References; Location/Allocation of Queuing Facilities in Continuous Space using Minisum and Minimax Criteria ; 1 Introduction2 The model 3 A solution method; 4 Computational results; 5 Conclusions; References; Algorithms for the Consistency Analysis in Scenario Projects; 1 Introduction; 2 Definitions; 3 Complexity ; 4 Algorithms ; 5 Conclusions ; ReferencesAssignment of Reusable and Non-Reusable Frequencies 1 Introduction; 2 Definitions and techniques; 3 The complexity of radio coloring and radio labeling; 4 An exact algorithm for constant number of colors ; 5 Algorithms for on-line radio labeling ; 6 Open problems ; ReferencesImage Space Analysis for Vector Optimization and Variational Inequalities. ScalarizationCombinatorial 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 celebratedSeries on applied mathematics ;v. 14.Combinatorial optimizationCongressesMathematical optimizationCongressesNonlinear programmingCongressesCombinatorial optimizationMathematical optimizationNonlinear programming511/.6Pardalos P. M(Panos M.),1954-318341Migdalas Athanasios1655772Burkard Rainer E536083MiAaPQMiAaPQMiAaPQBOOK9910819747503321Combinatorial and global optimization4040837UNINA