Sciweavers

OL
2010
140views more  OL 2010»
13 years 6 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
OL
2010
111views more  OL 2010»
13 years 10 months ago
Fifty years of maximal monotonicity
Maximal monotone operator theory is about to turn (or just has turned) fifty. I intend to briefly survey the history of the subject. I shall try to explain why maximal monotone ...
Jonathan M. Borwein
OL
2010
87views more  OL 2010»
13 years 10 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
O. L. Mangasarian, Michael C. Ferris
OL
2010
128views more  OL 2010»
13 years 10 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
OL
2010
185views more  OL 2010»
13 years 10 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems....
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P...
OL
2010
104views more  OL 2010»
13 years 10 months ago
On representations of the feasible set in convex optimization
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
Jean B. Lasserre
OL
2010
77views more  OL 2010»
13 years 10 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre