Near-optimal solutions for the generalized max-controlled set problem

DOI10.1016/j.cor.2010.01.012zbMath1188.90270OpenAlexW1969327771MaRDI QIDQ976048

Carlos A. Martinhon, Ivairton M. Santos, Luiz Satoru Ochi

Publication date: 11 June 2010

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.01.012

zbMATH Keywords

linear programmingtabu searchheuristicapproximation algorithmssandwich graph problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Size bounds for dynamic monopolies
• Bounded degree interval sandwich problems
• On the complexity of DNA physical mapping
• Local majorities, coalitions and monopolies in graphs: A review
• The power of small coalitions in graphs
• Max- and Min-neighborhood monopolies
• Distributed probabilistic polling and applications to proportionate agreement
• Path relinking for the vehicle routing problem
• Computing the Minimum Fill-In is NP-Complete
• Tabu Search—Part I
• Graph Sandwich Problems