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.

A forest exterior point algorithm for assignment problems, H. Achatz et al; location/allocation of queuing facilities in continuous space using minsum and minimax criteria, J. Brimberg et al; algorithms for the consistency analysis in scenario projects, R. Feldmann et al; solving quadratic knapsack problems by reformulation and tabu search -single constraint case, F. Glover et al; global optimization using dynamic search trajectories, A.A. Groenwold and J.A. Snyman; on Pareto efficiency - a general constructive existence principle, G. Isac; piecewise linear network flow problems, D. Kim and P.M. Pardalos; semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT - computational perspectives, E. de Klerk and J.P. Warners; heuristic solutions of vehicle routing problems in supply chain management, Y. Marinakis and A. Migdalas; a new finite cone covering algorithm for concave minimization, C. Meyer and B. Jaumard; frequency assignment for very large, sparse networks, R. Murphey; GPS network design - an application of the simulated annealing heuristic technique, H.A. Saleh and P.J. Dare; normal branch and bound algorithms for general nonconvex quadratic programming, H. Tuy. (Part contents)