Near-optimal solutions for the generalized max-controlled set problem
DOI10.1016/J.COR.2010.01.012zbMATH Open1188.90270OpenAlexW1969327771MaRDI QIDQ976048FDOQ976048
Authors: Ivairton M. Santos, Carlos Martinhon, Luiz S. 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
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Bounded degree interval sandwich problems
- On the complexity of DNA physical mapping
- Tabu Search—Part I
- Graph Sandwich Problems
- Local majorities, coalitions and monopolies in graphs: A review
- Fundamentals of scatter search and path relinking
- Size bounds for dynamic monopolies
- Computing the Minimum Fill-In is NP-Complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The power of small coalitions in graphs
- Path relinking for the vehicle routing problem
- Distributed probabilistic polling and applications to proportionate agreement
- Max- and Min-neighborhood monopolies
- Reactive tabu search with path-relinking for the Steiner problem in graphs
Cited In (2)
Uses Software
This page was built for publication: Near-optimal solutions for the generalized max-controlled set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976048)
