Sciweavers

106 search results - page 2 / 22
» On Quadratic Programming with a Ratio Objective
Sort
View
EOR
2010
113views more  EOR 2010»
13 years 4 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 2 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
DAC
1994
ACM
13 years 8 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
EUSFLAT
2009
155views Fuzzy Logic» more  EUSFLAT 2009»
13 years 2 months ago
A Generalized Numerical Solution for Fuzzy Relation Equations
In this paper, line search based on Sequential Quadratic Programming is implemented in order to find a solution to Fuzzy Relation Equations. Sequential Quadratic Programming is a g...
Iman Mohammadi Ardehali, Milad Avazbeigi
CVPR
2007
IEEE
14 years 6 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl