AAAAAA
Results: 1-25/32
Authors:
Abello, J
Krishnan, S
Citation: J. Abello et S. Krishnan, Navigating graph surfaces, NONC OPTIM, 42, 2000, pp. 1-16
Authors:
Albrecht, J
Cieslik, D
Citation: J. Albrecht et D. Cieslik, The Steiner ratio of L-p-planes, NONC OPTIM, 42, 2000, pp. 17-30
Authors:
Andramonov, M
Filar, J
Pardalos, P
Rubinov, A
Citation: M. Andramonov et al., Hamiltonian Cycle Problem via Markov chains and min-type approaches, NONC OPTIM, 42, 2000, pp. 31-47
Authors:
Barahona, F
Chudak, FA
Citation: F. Barahona et Fa. Chudak, Solving large scale uncapacitated facility location problems, NONC OPTIM, 42, 2000, pp. 48-62
Authors:
Barnes, ER
Citation: Er. Barnes, A branch-and-bound procedure for the largest clique in a graph, NONC OPTIM, 42, 2000, pp. 63-77
Authors:
Bomze, IM
Budinich, M
Pelillo, M
Rossi, C
Citation: Im. Bomze et al., A new "annealed" heuristic for the maximum clique problem, NONC OPTIM, 42, 2000, pp. 78-95
Authors:
Brieden, A
Gritzmann, P
Klee, V
Citation: A. Brieden et al., Inapproximability of some geometric and quadratic optimization problems, NONC OPTIM, 42, 2000, pp. 96-115
Authors:
Calvin, JM
Citation: Jm. Calvin, Convergence rate of the P-algorithm for optimization of continuous functions, NONC OPTIM, 42, 2000, pp. 116-129
Authors:
Choi, CC
Ye, YY
Citation: Cc. Choi et Yy. Ye, Application of Semidefinite Programming to circuit partitioning, NONC OPTIM, 42, 2000, pp. 130-137
Authors:
Cook, D
Hicks, G
Faber, V
Marathe, MV
Srinivasan, A
Sussmann, YJ
Thornquist, H
Citation: D. Cook et al., Combinatorial problems arising in deregulated electrical power industry: Survey and future directions, NONC OPTIM, 42, 2000, pp. 138-162
Authors:
Crescenzi, P
Deng, XT
Papadimitriou, CH
Citation: P. Crescenzi et al., On approximating a scheduling problem, NONC OPTIM, 42, 2000, pp. 163-174
Authors:
Ferris, MC
Meyer, RR
Citation: Mc. Ferris et Rr. Meyer, Models and solution for on-demand data delivery problems, NONC OPTIM, 42, 2000, pp. 175-188
Authors:
Festa, P
Cerulli, R
Raiconi, G
Citation: P. Festa et al., Complexity and experimental evaluation of primal-dual Shortest Path Tree algorithms, NONC OPTIM, 42, 2000, pp. 189-208
Authors:
Fotakis, DA
Spirakis, PG
Citation: Da. Fotakis et Pg. Spirakis, Machine partitioning and scheduling under fault-tolerance constraints, NONC OPTIM, 42, 2000, pp. 209-244
Authors:
Franco, J
Citation: J. Franco, Finding optimal Boolean classifiers, NONC OPTIM, 42, 2000, pp. 245-286
Authors:
Furer, M
Citation: M. Furer, Tighter bounds on the performance of First Fit Bin Packing, NONC OPTIM, 42, 2000, pp. 287-297
Authors:
Hager, WW
Park, SC
Davis, TA
Citation: Ww. Hager et al., Block exchange in graph partitioning, NONC OPTIM, 42, 2000, pp. 298-307
Authors:
Hunt, HB
Marathe, MV
Stearns, RE
Citation: Hb. Hunt et al., On the efficient approximability of "HARD" problems: A survey, NONC OPTIM, 42, 2000, pp. 308-322
Authors:
Isac, G
Citation: G. Isac, Exceptional family of elements, feasibility, solvability and continuous paths of epsilon-solutions for nonlinear complementarity problems, NONC OPTIM, 42, 2000, pp. 323-337
Authors:
Jansen, K
Solis-Oba, R
Sviridenko, M
Citation: K. Jansen et al., Linear time approximation schemes for shop scheduling problems, NONC OPTIM, 42, 2000, pp. 338-346
Authors:
Korotkich, V
Citation: V. Korotkich, On complexity and optimization in emergent computation, NONC OPTIM, 42, 2000, pp. 347-363
Authors:
Kreinovich, V
Citation: V. Kreinovich, Beyond interval systems: What is feasible and what is algorithmically solvable?, NONC OPTIM, 42, 2000, pp. 364-379
Authors:
du Merle, O
Goffin, JL
Trouiller, C
Vial, JP
Citation: O. Du Merle et al., A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm, NONC OPTIM, 42, 2000, pp. 380-405
Authors:
Murphey, RA
Citation: Ra. Murphey, An approximate algorithm for a Weapon Target Assignment stochastic program, NONC OPTIM, 42, 2000, pp. 406-421
Authors:
Pelillo, M
Siddiqi, K
Zucker, SW
Citation: M. Pelillo et al., Continuous-based heuristics for graph and tree isomorphisms, with application to computer vision, NONC OPTIM, 42, 2000, pp. 422-445