Near-optimal solutions for the generalized max-controlled set problem
From MaRDI portal
Publication:976048
Recommendations
Cites work
- scientific article; zbMATH DE number 1302201 (Why is no real title available?)
- scientific article; zbMATH DE number 1054674 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Bounded degree interval sandwich problems
- Computing the Minimum Fill-In is NP-Complete
- Distributed probabilistic polling and applications to proportionate agreement
- Fundamentals of scatter search and path relinking
- Graph Sandwich Problems
- Local majorities, coalitions and monopolies in graphs: A review
- Max- and Min-neighborhood monopolies
- Network flows. Theory, algorithms, and applications.
- On the complexity of DNA physical mapping
- Path relinking for the vehicle routing problem
- Reactive tabu search with path-relinking for the Steiner problem in graphs
- Size bounds for dynamic monopolies
- Tabu Search—Part I
- The power of small coalitions in graphs
Cited in
(2)
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)