8 search results - page 1 / 2 » The edge-weighted clique problem: Valid inequalities, facets... |
EOR
2000
13 years 10 months ago
2000
DISOPT
2011
13 years 2 months ago
2011
Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation net...
MP
2006
13 years 11 months ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
IOR
2011
13 years 5 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
MP
1998
13 years 10 months ago
1998
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...