Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

33

Voted

EOR
2000

favoriteEmaildiscussreport

85views more EOR 2000»

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

13 years 10 months ago

The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

Download www.ic.unicamp.br

Elder Magalhães Macambira, Cid Carvalho de

Real-time Traffic

EOR 2000 |

claim paper

Related Content

» Valid inequalities and branchandcut for the clique pricing problem

» Twoedge connected subgraphs with bounded rings Polyhedral results and BranchandCut

» Clique Relaxations in Social Network Analysis The Maximum kPlex Problem

» Capacitated facility location Separation algorithms and computational experience

» The traveling salesman problem with pickup and delivery polyhedral results and a branchand...

» On cutbased inequalities for capacitated network design polyhedra

» Solving the feedback vertex set problem on undirected graphs

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	EOR
Authors	Elder Magalhães Macambira, Cid Carvalho de Souza

Comments (0)