Exact solutions to generalized vertex covering problems: a comparison of two models
From MaRDI portal
Publication:499689
DOI10.1007/s11590-015-0851-1zbMath1332.90226OpenAlexW2108109721MaRDI QIDQ499689
Fred Glover, Haibo Wang, Mark Lewis, Gary A. Kochenberger
Publication date: 6 October 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0851-1
Related Items (4)
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 ⋮ Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem
Uses Software
Cites Work
- 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
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
- A new penalty parameter for linearly constrained 0--1 quadratic programming problems
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- The minimum generalized vertex cover problem
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem
This page was built for publication: Exact solutions to generalized vertex covering problems: a comparison of two models
