On provably best construction heuristics for hard combinatorial optimization problems

DOI10.1002/net.21620zbMath1390.90467OpenAlexW1597139733MaRDI QIDQ4639688

Sera Kahruman-Anderoglu, Oleg A. Prokopyev, Austin Buchanan, Sergiy I. Butenko

Publication date: 11 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21620

zbMATH Keywords

heuristicscombinatorial optimizationgraphscliquedominating setcoloringnetwork optimization\(k\)-club

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts ⋮ Optimal approximation algorithms for maximum distance-bounded subgraph problems ⋮ On biconnected and fragile subgraphs of low diameter ⋮ On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs

This page was built for publication: On provably best construction heuristics for hard combinatorial optimization problems