Sciweavers

OL
2007
121views more  OL 2007»
13 years 11 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...
OL
2007
68views more  OL 2007»
13 years 11 months ago
An ILP based hierarchical global routing approach for VLSI ASIC design
Zhen Yang, Anthony Vannelli, Shawki Areibi
OL
2007
87views more  OL 2007»
13 years 11 months ago
Proximality and Chebyshev sets
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimens...
Jonathan M. Borwein
OL
2007
103views more  OL 2007»
13 years 11 months ago
Support vector machine via nonlinear rescaling method
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
Roman A. Polyak, Shen-Shyang Ho, Igor Griva
OL
2007
156views more  OL 2007»
13 years 11 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski
OL
2007
71views more  OL 2007»
13 years 11 months ago
An effective modeling and solution approach for the generalized independent set problem
Gary A. Kochenberger, Bahram Alidaee, Fred Glover,...
OL
2007
133views more  OL 2007»
13 years 11 months ago
An SQP-type algorithm for nonlinear second-order cone programs
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
Hirokazu Kato, Masao Fukushima
OL
2007
118views more  OL 2007»
13 years 11 months ago
A counterexample to the dominating set conjecture
Abstract The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + x...
Antoine Deza, Gabriel Indik