Sciweavers

1816 search results - page 47 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ICTAI
2002
IEEE
15 years 4 months ago
Adjusted Network Flow for the Shelf-Space Allocation Problem
In this paper, we study shelf space allocation optimization which is important to retail operations management. Our approach is to formulate a model that is applicable to operatio...
Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zha...
CGF
2008
126views more  CGF 2008»
14 years 12 months ago
Maximum Entropy Coordinates for Arbitrary Polytopes
Barycentric coordinates can be used to express any point inside a triangle as a unique convex combination of the triangle's vertices, and they provide a convenient way to lin...
K. Hormann, N. Sukumar
ICCAD
1996
IEEE
114views Hardware» more  ICCAD 1996»
15 years 4 months ago
An efficient approach to simultaneous transistor and interconnect sizing
In this paper, we study the simultaneous transistor and interconnect sizing (STIS) problem. We de ne a class of optimization problems as CH-posynomial programs and reveal a genera...
Jason Cong, Lei He
ACCV
2007
Springer
15 years 1 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
15 years 1 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha