Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999 (Q1582793)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Abello, James; Krishnan, Shankar}, Navigating graph surfaces, 1-16 [Zbl 0967.68122] \textit{Albrecht, Jens; Cieslik, Dietmar}, The Steiner ratio of \(L_p\)-planes, 17-30 [Zbl 0968.68119] \textit{Andramonov, Mikhail; Filar, Jerzy; Pardalos, Panos; Robinov, Alexander}, Hamiltonian cycle problem via Markov chains and min-type approaches, 31-47 [Zbl 0965.05067] \textit{Barahona, Francisco; Chudak, Fabián A.}, Solving large scale uncapacitated facility location problems, 48-62 [Zbl 0965.90027] \textit{Barnes, Earl R.}, A branch-and-bound procedure for the largest clique in a graph, 63-77 [Zbl 0968.68120] \textit{Bomze, Immanuel M.; Budinich, Marco; Pelillo, Marcello; Rossi, Claudio}, A new ``annealed'' heuristic for the maximum clique problem, 78-95 [Zbl 0965.90041] \textit{Brieden, Andreas; Gritzmann, Peter; Klee, Victor}, Inapproximability of some geometric and quadratic optimization problems, 96-115 [Zbl 0976.90076] \textit{Calvin, James M.}, Convergence rate of the P-algorithm for optimization of continuous functions, 116-129 [Zbl 0964.65063] \textit{Choi, Changhui Cris; Ye, Yinyu}, Application of semidefinite programming to circuit partitioning, 130-137 [Zbl 0976.90077] \textit{Cook, Doug; Hicks, Gregory; Faber, Vance; Marathe, Madhav V.; Srinivasan, Aravind; Sussmann, Yoram J.; Thornquist, Heidi}, Combinatorial problems arising in deregulated electrical power industry: Survey and future directions, 138-162 [Zbl 1001.90056] \textit{Crescenzi, Pierluigi; Deng, Xiaotie; Papadimitriou, Christos H.}, On approximating a scheduling problem, 163-174 [Zbl 0968.90035] \textit{Ferris, Michael C.; Meyer, Robert R.}, Models and solution for on-demand data delivery problems, 175-188 [Zbl 0967.68501] \textit{Festa, Paola; Cerulli, Raffaele; Raiconi, Giancarlo}, Complexity and experimental evaluation of primal-dual shortest path tree algorithms, 189-208 [Zbl 0963.68158] \textit{Fotakis, Dimitris A.; Spirakis, Paul G.}, Machine partitioning and scheduling under fault-tolerance constraints, 209-244 [Zbl 0996.90041] \textit{Franco, John}, Finding optimal Boolean classifiers, 245-286 [Zbl 0961.62003] \textit{Fürer, Martin}, Tighter bounds on the performance of first fit bin packing, 287-297 [Zbl 0976.90088] \textit{Hager, William W.; Park, Soon Chul; Davis, Timothy A.}, Block exchange in graph partitioning, 298-307 [Zbl 0982.90060] \textit{Hunt, Harry B. III; Marathe, Madhav V.; Stearns, Richard E.}, On the efficient approximability of ''HARD'' problems: A survey, 308-322 [Zbl 0967.68110] \textit{Isac, G.}, Exceptional family of elements, feasibility, solvability and continuous paths of \(\varepsilon\)-solutions for nonlinear complementarity problems, 323-337 [Zbl 0976.90113] \textit{Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim}, Linear time approximation schemes for shop scheduling problems, 338-346 [Zbl 0976.90041] \textit{Korotkich, Victor}, On complexity and optimization in emergent computation, 347-363 [Zbl 0967.68081] \textit{Kreinovich, Vladik}, Beyond interval systems: What is feasible and what is algorithmically solvable?, 364-379 [Zbl 0964.65051] \textit{du Merle, O.; Goffin, J.-L.; Trouiller, C.; Vial, J.-P.}, A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm., 380-405 [Zbl 1052.90070] \textit{Murphey, Robert A.}, An approximation algorithm for a weapon target assignment stochastic program, 406-421 [Zbl 0976.90061] \textit{Pelillo, Marcello; Siddiqi, Kaleem; Zucker, Steven W.}, Continuous-based heuristics for graph and tree isomorphisms, with application to computer vision, 422-445 [Zbl 0968.68121] \textit{MacGregor Smith, J.}, Geometric optimization problems for Steiner minimal trees in \(E^3\), 446-476 [Zbl 0973.90067] \textit{Sosnowska, Danuta}, Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP, 477-488 [Zbl 1012.90543] \textit{Takeda, Akiko; Dai, Yang; Fukuda, Mituhiro; Kojima, Masakazu}, Towards implementations of successive convex relaxation methods for nonconvex quadratic optimization problems, 489-510 [Zbl 0966.65054] \textit{Tardella, Fabio}, Piecewise concavity and discrete approaches to continuous minimax problems, 511-524 [Zbl 0980.90067] \textit{Tuy, Hoang}, The MCCNF problem with a fixed number of nonlinear arc costs: Complexity and approximation, 525-544 [Zbl 0985.90010] \textit{Verma, Sushil; Beling, Peter A.; Adler, Ilan}, A new parametrization algorithm for the linear complementarity problem, 545-560 [Zbl 0964.65070] \textit{Yajima, Yasutoshi}, Obtaining an approximate solution for quadratic maximization problems, 561-577 [Zbl 0964.65064]