Exact solutions to generalized vertex covering problems: a comparison of two models
From MaRDI portal
Recommendations
Cites work
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- A parallel algorithm for the minimum weighted vertex cover problem
- An ant colony optimization algorithm for the minimum weight vertex cover problem
- Computationally attractive nonlinear models for combinatorial optimisation
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
- The minimum generalized vertex cover problem
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
Cited in
(4)- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
- The unconstrained binary quadratic programming problem: a survey
- The generalized vertex cover problem and some variations
- An efficient local search framework for the minimum weighted vertex cover problem
This page was built for publication: Exact solutions to generalized vertex covering problems: a comparison of two models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499689)