AAAAAA

   
Results: 1-13 |
Results: 13
SEMIDEFINITE PROGRAMMING RELAXATIONS FOR THE QUADRATIC ASSIGNMENT PROBLEM
Authors: ZHAO Q KARISCH SE RENDL F WOLKOWICZ H
Citation: Q. Zhao et al., SEMIDEFINITE PROGRAMMING RELAXATIONS FOR THE QUADRATIC ASSIGNMENT PROBLEM, Journal of combinatorial optimization, 2(1), 1998, pp. 71-109
ON THE APPLICABILITY OF LOWER BOUNDS FOR SOLVING RECTILINEAR QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL
Authors: CLAUSEN J KARISCH SE PERREGAARD M RENDL F
Citation: J. Clausen et al., ON THE APPLICABILITY OF LOWER BOUNDS FOR SOLVING RECTILINEAR QUADRATIC ASSIGNMENT PROBLEMS IN PARALLEL, COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 10(2), 1998, pp. 127-147
SOLVING QUADRATIC (0,1)-PROBLEMS BY SEMIDEFINITE PROGRAMS AND CUTTINGPLANES
Authors: HELMBERG C RENDL F
Citation: C. Helmberg et F. Rendl, SOLVING QUADRATIC (0,1)-PROBLEMS BY SEMIDEFINITE PROGRAMS AND CUTTINGPLANES, Mathematical programming, 82(3), 1998, pp. 291-315
CONNECTIONS BETWEEN SEMIDEFINITE RELAXATIONS OF THE MAX-CUT AND STABLE SET PROBLEMS
Authors: LAURENT M POLJAK S RENDL F
Citation: M. Laurent et al., CONNECTIONS BETWEEN SEMIDEFINITE RELAXATIONS OF THE MAX-CUT AND STABLE SET PROBLEMS, Mathematical programming, 77(2), 1997, pp. 225-246
A SEMIDEFINITE FRAMEWORK FOR TRUST REGION SUBPROBLEMS WITH APPLICATIONS TO LARGE-SCALE MINIMIZATION
Authors: RENDL F WOLKOWICZ H
Citation: F. Rendl et H. Wolkowicz, A SEMIDEFINITE FRAMEWORK FOR TRUST REGION SUBPROBLEMS WITH APPLICATIONS TO LARGE-SCALE MINIMIZATION, Mathematical programming, 77(2), 1997, pp. 273-299
AN INTERIOR-POINT METHOD FOR SEMIDEFINITE PROGRAMMING
Authors: HELMBERG C RENDL F VANDERBEI RJ WOLKOWICZ H
Citation: C. Helmberg et al., AN INTERIOR-POINT METHOD FOR SEMIDEFINITE PROGRAMMING, SIAM journal on optimization, 6(2), 1996, pp. 342-361
SOLVING THE MAX-CUT PROBLEM USING EIGENVALUES
Authors: POLJAK S RENDL F
Citation: S. Poljak et F. Rendl, SOLVING THE MAX-CUT PROBLEM USING EIGENVALUES, Discrete applied mathematics, 62(1-3), 1995, pp. 249-278
NONPOLYHEDRAL RELAXATIONS OF GRAPH-BISECTION PROBLEMS
Authors: POLJAK S RENDL F
Citation: S. Poljak et F. Rendl, NONPOLYHEDRAL RELAXATIONS OF GRAPH-BISECTION PROBLEMS, SIAM journal on optimization, 5(3), 1995, pp. 467-487
LOWER BOUNDS FOR THE QUADRATIC ASSIGNMENT PROBLEM VIA TRIANGLE DECOMPOSITIONS
Authors: KARISCH SE RENDL F
Citation: Se. Karisch et F. Rendl, LOWER BOUNDS FOR THE QUADRATIC ASSIGNMENT PROBLEM VIA TRIANGLE DECOMPOSITIONS, Mathematical programming, 71(2), 1995, pp. 137-151
A COMPUTATIONAL STUDY OF GRAPH PARTITIONING
Authors: FALKNER J RENDL F WOLKOWICZ H
Citation: J. Falkner et al., A COMPUTATIONAL STUDY OF GRAPH PARTITIONING, Mathematical programming, 66(2), 1994, pp. 211-239
NODE AND EDGE RELAXATIONS OF THE MAX-CUT PROBLEM
Authors: POLJAK S RENDL F
Citation: S. Poljak et F. Rendl, NODE AND EDGE RELAXATIONS OF THE MAX-CUT PROBLEM, Computing, 52(2), 1994, pp. 123-137
RECONSTRUCTING SETS OF ORTHOGONAL LINE SEGMENTS IN THE PLANE
Authors: RENDL F WOEGINGER G
Citation: F. Rendl et G. Woeginger, RECONSTRUCTING SETS OF ORTHOGONAL LINE SEGMENTS IN THE PLANE, Discrete mathematics, 119(1-3), 1993, pp. 167-174
SYMMETRIZATION OF NONSYMMETRIC QUADRATIC ASSIGNMENT PROBLEMS AND THE HOFFMAN-WIELANDT INEQUALITY
Authors: HADLEY SW RENDL F WOLKOWICZ H
Citation: Sw. Hadley et al., SYMMETRIZATION OF NONSYMMETRIC QUADRATIC ASSIGNMENT PROBLEMS AND THE HOFFMAN-WIELANDT INEQUALITY, Linear algebra and its applications, 167, 1992, pp. 53-64
Risultati: 1-13 |