| Preface | p. vii |
| A Forest Exterior Point Algorithm for Assignment Problems | p. 1 |
| Introduction | p. 2 |
| Preliminaries | p. 2 |
| Description of the algorithm | p. 3 |
| Correctness and complexity of the algorithm | p. 5 |
| Concluding remarks | p. 9 |
| References | p. 9 |
| A Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization | p. 11 |
| Introduction | p. 12 |
| Genetic, scatter search and tabu serach approach | p. 13 |
| HSGT algorithm description | p. 16 |
| Weight computations | p. 18 |
| Computational results | p. 20 |
| Conclusions and recommendations | p. 21 |
| Test functions | p. 22 |
| References | p. 29 |
| Exact Rates of Prokhorov Convergence under Three Moment Conditions | p. 33 |
| Main result | p. 34 |
| Outline of proof | p. 38 |
| References | p. 42 |
| Location/Allocation of Queuing Facilities in Continuous Space using Minsum and Minimax Criteria | p. 43 |
| Introduction | p. 44 |
| The model | p. 45 |
| A solution method | p. 48 |
| Computational results | p. 50 |
| Conclusions | p. 52 |
| References | p. 52 |
| Algorithms for the Consistency Analysis in Scenario Projects | p. 55 |
| Introduction | p. 56 |
| Definitions | p. 58 |
| Complexity | p. 59 |
| Algorithms | p. 63 |
| Conclusions | p. 72 |
| References | p. 72 |
| Assignment of Reusable and Non-Reusable Frequencies | p. 75 |
| Introduction | p. 76 |
| Definitions and techniques | p. 77 |
| The complexity of radio coloring and radio labelling | p. 81 |
| An exact algorithm for constant number of colors | p. 84 |
| Algorithms for on-line radio labelling | p. 90 |
| Open problems | p. 93 |
| References | p. 94 |
| Image Space Analysis for Vector Optimization and Variational Inequalities. Scalarization | p. 97 |
| Introduction | p. 98 |
| A separation scheme | p. 99 |
| On the scalarization of vector optimization | p. 101 |
| Vector variational inequalities | p. 105 |
| References | p. 108 |
| Solving Quadratic Knapsack Problems by Reformulation and Tabu Search. Single Constraint Case | p. 111 |
| Introduction | p. 112 |
| Reformulation | p. 113 |
| Computational experiments | p. 115 |
| Summary and conclusions | p. 119 |
| Overview of our tabu search algorithm | p. 120 |
| References | p. 120 |
| Global Optimization using Dynamic Search Trajectories | p. 123 |
| Introduction | p. 124 |
| The Snyman-Fatti trajectory method | p. 125 |
| The modified bouncing ball trajectory method | p. 127 |
| Global stopping criterion | p. 128 |
| Numerical results | p. 129 |
| Conclusions | p. 131 |
| References | p. 131 |
| On Pareto Efficiency. A General Constructive Existence Principle | p. 133 |
| Introduction | p. 133 |
| Preliminaries | p. 135 |
| The main result | p. 136 |
| Realizations of Theorem 1 | p. 137 |
| References | p. 142 |
| Piecewise Linear Network Flow Problems | p. 145 |
| Introduction | p. 146 |
| Applications | p. 156 |
| Concluding remarks | p. 157 |
| References | p. 158 |
| Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives | p. 161 |
| Introduction | p. 162 |
| The SDP relaxation of MAX-2-SAT | p. 162 |
| Additional valid inequalities | p. 165 |
| Solving the SDP relaxation of MAX-2-SAT | p. 166 |
| A branch and cut framework | p. 168 |
| Numerical experiments | p. 171 |
| Future work | p. 172 |
| References | p. 175 |
| On a Data Structure in a Global Description of Sequences | p. 177 |
| Introduction | p. 177 |
| Structural numbers and their geometric interpretation | p. 179 |
| Structural numbers as coordinates of a space and a system of linear equations | p. 181 |
| Integer patterns: Means for the visualization of the system | p. 185 |
| What picture appears when the system is visualized: An illustrative example | p. 186 |
| Definition of the structure and its isomorphic representations: Web of relations | p. 191 |
| On descriptive potentialities of the structure: Simple examples of global optimization problems | p. 195 |
| References | p. 203 |
| Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management | p. 205 |
| Introduction | p. 206 |
| Supply chain management | p. 206 |
| The vehicle routing problem | p. 207 |
| Classic heuristics for the traveling salesman and the vehicle routing problems | p. 210 |
| Metaheuristics for the traveling salesman and the vehicle routing problems | p. 219 |
| Computational results | p. 228 |
| References | p. 231 |
| A New Finite Cone Covering Algorithm for Concave Minimization | p. 237 |
| Introduction | p. 238 |
| Basic operations | p. 239 |
| Algorithm | p. 246 |
| Conclusions | p. 247 |
| References | p. 247 |
| A Diagonal Global Optimization Method | p. 251 |
| Introduction | p. 252 |
| Diagonal information global optimization algorithm and its new convergence conditions | p. 253 |
| A new diagonal information algorithm | p. 256 |
| Numerical results | p. 258 |
| Conclusions | p. 260 |
| References | p. 262 |
| Frequency Assignment for Very Large, Sparse Networks | p. 265 |
| Introduction | p. 266 |
| Minimum order and minimum span assignments | p. 267 |
| Alternate graph approach | p. 272 |
| Local search | p. 275 |
| Experimental results | p. 276 |
| Conclusions | p. 280 |
| References | p. 280 |
| A Derivative Free Minimization Method for Noisy Functions | p. 283 |
| Introduction | p. 283 |
| Optimization of noisy functions | p. 284 |
| A derivative-free minimization method for imprecise problems and its convergence | p. 286 |
| Numerical applications | p. 289 |
| Concluding remarks | p. 293 |
| References | p. 294 |
| Tight QAP Bounds via Linear Programming | p. 297 |
| LP-based lower bounds for the QAP | p. 298 |
| Experimental results | p. 299 |
| Concluding remarks | p. 301 |
| References | p. 302 |
| GPS Network Design: An Application of the Simulated Annealing Heuristic Technique | p. 305 |
| Introduction | p. 306 |
| Simulated annealing technique | p. 307 |
| Formulation of the GPS surveying problem | p. 307 |
| The GPS-simulated annealing algorithm | p. 309 |
| Computational results | p. 309 |
| Further work and conclusion | p. 310 |
| References | p. 311 |
| Global Optimization for Crack Identification: Impact-Echo Experiments | p. 317 |
| Introduction | p. 317 |
| Global optimization for inverse problems | p. 319 |
| Mechanical modelling | p. 320 |
| Inverse problem | p. 326 |
| Conclusion | p. 328 |
| References | p. 329 |
| Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming | p. 333 |
| Introduction | p. 333 |
| A generic BB algorithm | p. 335 |
| Examples | p. 338 |
| Quadratic system equivalent to a linear system | p. 340 |
| General decoupling scheme | p. 344 |
| Linear relaxations | p. 345 |
| Semidefinite relaxation | p. 349 |
| References | p. 353 |
| Table of Contents provided by Syndetics. All Rights Reserved. |
