Combinatorial and global optimization (Series on applied mathematics-vol. 14)
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 u...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | eBook Book |
| Language: | English |
| Published: |
New Jersey ; Singapore
World Scientific Publishing Co. Pte. Ltd
2002
World Scientific World Scientific Publishing Company WORLD SCIENTIFIC World Scientific Publishing |
| Edition: | 1 |
| Series: | Series on applied mathematics |
| Subjects: | |
| ISBN: | 9810248024, 9789810248024, 9789812778215, 9812778217, 9789814489652, 9814489654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Combinatorial and global optimization (Series on applied mathematics-vol. 14) -- Preface -- Contents -- A Forest Exterior Point Algorithm for Assignment Problems -- A Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization -- Exact Rates of Prokhorov Convergence under Three Moment Conditions -- Location/Allocation of Queuing Facilities in Continuous Space using Minisum and Minimax Criteria -- Algorithms for the Consistency Analysis in Scenario Projects -- Assignment of Reusable and Non-Reusable Frequencies -- Image Space Analysis for Vector Optimization and Variational Inequalities. Scalarization -- Solving Quadratic Knapsack Problems by Reformulation and Tabu Search. Single Constraint Case -- Global Optimization using Dynamic Search Trajectories -- On Pareto Efficiency. A General Constructive Existence Principle -- Piecewise Linear Network Flow Problems -- Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives -- On a Data Structure in a Global Description of Sequences -- Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management -- A New Finite Cone Covering Algorithm for Concave Minimization -- A Diagonal Global Optimization Method -- Frequency Assignment for Very Large Sparse Networks -- A Derivative Free Minimization Method for Noisy Functions -- Tight QAP Bounds via Linear Programming -- GPS Network Design: An Application of the Simulated Annealing Heuristic Technique -- Global Optimization for Crack Identification: Impact-Echo Experiments -- Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming.
- 2 Basic operations -- 3 Algorithm -- 4.Conclusions -- References -- A Diagonal Global Optimization Method -- 1 Introduction -- 2 Diagonal information global optimization algorithm and its new convergence conditions -- 3 A new diagonal information algorithm -- 4 Numerical results -- 5 Conclusions -- References -- Frequency Assignment for Very Large Sparse Networks -- 1 Introduction -- 2 Minimum order and minimum span assignments -- 3 Alternate graph approach -- 4 Local search -- 5 Experimental results -- 6 Conclusions -- References -- A Derivative Free Minimization Method for Noisy Functions -- 1 Introduction -- 2 Optimization of noisy functions -- 3 A derivative-free minimization method for imprecise problems and its convergence -- 4 Numerical applications -- 5 Concluding remarks -- References -- Tight QAP Bounds via Linear Programming -- 1 LP-based lower bounds for the QAP -- 2 Experimental results -- 3 Concluding remarks -- References -- GPS Network Design: An Application of the Simulated Annealing Heuristic Technique -- 1 Introduction -- 2 Simulated annealing technique -- 3 Formulation of the GPS surveying problem -- 4 The GPS-simulated annealing algorithm -- 5 Computational results -- 6 Further work and conclusion -- References -- Global Optimization for Crack Identification:Impact-Echo Experiments -- 1 Introduction -- 2 Global optimization for inverse problems -- 3 Mechanical modelling -- 4 Inverse problem -- 5 Conclusion -- References -- Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming -- 1 Introduction -- 2 A generic BB algorithm -- 3 Examples -- 4 Quadratic system equivalent to a linear system -- 5 General decoupling scheme -- 6 Linear relaxations -- 7 Semidefinite relaxation -- References
- Global Optimization using Dynamic Search Trajectories -- 1 Introduction -- 2 The Snyman-Fatti trajectory method -- 3 The modified bouncing ball trajectory method -- 4 Global stopping criterion -- 5 Numerical results -- 6 Conclusions -- References -- On Pareto Efficiency. A General Constructive Existence Principle -- 1 Introduction -- 2 Preliminaries -- 3 The main result -- 4 Realizations of Theorem 1 -- References -- Piecewise Linear Network Flow Problems -- 1 Introduction -- 2 Applications -- 3 Concluding remarks -- References -- Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives -- 1 Introduction -- 2 The SDP relaxation of MAX-2-SAT -- 3 Additional valid inequalities -- 4 Solving the SDP relaxation of MAX-2-SAT -- 5 A branch and cut framework -- 6 Numerical experiments -- 7 Future work -- References -- On a Data Structure in a Global Description of Sequences -- 1 Introduction -- 2 Structural numbers and their geometric interpretation -- 3 Structural numbers as coordinates of a space and a system of linear equations -- 4 Integer patterns: Means for the visualization of the system -- 5 What picture appears when the system is visualized: An illustrative example -- 6 Definition of the structure and its isomorphic representations: Web of relations -- 7 On descriptive potentialities of the structure: Simple examples of global optimization problems -- References -- Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management -- 1 Introduction -- 2 Supply chain management -- 3 The vehicle routing problem -- 4 Classic heuristics for the traveling salesman and the vehicle routing problems -- 5 Metaheuristics for the traveling salesman and the vehicle routing problems -- 6 Computational results -- References -- A New Finite Cone Covering Algorithm for Concave Minimization -- 1 Introduction
- Intro -- 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 -- References -- A Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization -- 1 Introduction -- 2 Genetic scatter search and tabu serach approach -- 3 HSGT algorithm description -- 4 Weight computations -- 5 Computational results -- 6 Conclusions and recommendations -- Appendix 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 Introduction -- 2 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 -- References -- Assignment of Reusable and Non-Reusable Frequencies -- 1 Introduction -- 2 Definitions and techniques -- 3 The complexity of radio coloring and radio labelling -- 4 An exact algorithm for constant number of colors -- 5 Algorithms for on-line radio labelling -- 6 Open problems -- References -- Image Space Analysis for Vector Optimization and Variational Inequalities. Scalarization -- 1 Introduction -- 2 A separation scheme -- 3 On the scalarization of vector optimization -- 4 Vector variational inequalities -- References -- Solving Quadratic Knapsack Problems by Reformulation and Tabu Search. Single Constraint Case -- 1 Introduction -- 2 Reformulation -- 3 Computational experiments -- 4 Summary and conclusions -- Appendix: Overview of our tabu search algorithm -- References