Back to Results
First PageMeta Content
NP-complete problems / Clique / Independent set / Maximal independent set / Tree decomposition / Path decomposition / Graph theory / Theoretical computer science / Mathematics


A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA
Add to Reading List

Document Date: 2009-02-11 00:35:51

Open Document

File Size: 253,75 KB

Share Result on Facebook

City

Gainesville / Straus / /

Company

xT AG / matrix AG / /

/

Facility

University of Florida / Weil Hall / /

IndustryTerm

neural networks / genetic algorithms / heuristic algorithms / tabu search / continuous maximum weight clique algorithm / combinatorial algorithms / feasible solution / local search heuristics / polynomial time algorithm / augmentation algorithm / improved feasible solution / software package implementing / /

MarketIndex

DIMACS / /

Organization

Busygin Industrial and Systems Engineering Department / University of Florida / /

Person

Stanislav Busygin / /

ProgrammingLanguage

FL / /

ProvinceOrState

Florida / /

SportsEvent

ufl / /

Technology

PBH algorithm / continuous maximum weight clique algorithm / Max-AO algorithm / polynomial time algorithm / augmentation algorithm / QSH algorithms / /

SocialTag