Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An augmentation algorithm for the maximum weighted stable set problem

From MaRDI portal
Publication:1819158
Jump to:navigation, search

DOI10.1023/A:1026456624746zbMath0954.90041OpenAlexW1525400397MaRDI QIDQ1819158

Carlo Mannino, Egidio Stefanutti

Publication date: 9 February 2001

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026456624746

zbMATH Keywords

maximum stable set problemaugmentation algorithmtabu-search heuristic


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items

A review on algorithms for maximum clique problems, Solving the maximum vertex weight clique problem via binary quadratic programming, On a continuous approach for the maximum weighted clique problem, A new trust region technique for the maximum weight clique problem, Struction revisited, Stability preserving transformations of graphs, Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling, PUSH: A generalized operator for the maximum vertex weight clique problem, Multi-neighborhood tabu search for the maximum weight clique problem



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1819158&oldid=14179643"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki