Integer-programming bounds on pebbling numbers of Cartesian-product graphs
From MaRDI portal
Publication:2327149
DOI10.1007/978-3-030-04651-4_46OpenAlexW2900840427MaRDI QIDQ2327149
Franklin H. J. Kenter, Daphne E. Skipper
Publication date: 11 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_46
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ Cycles and girth in pebble assignment graphs ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ Automating weight function generation in graph pebbling ⋮ Computing bounds on product graph pebbling numbers ⋮ A computational status update for exact rational mixed integer programming ⋮ A computational status update for exact rational mixed integer programming ⋮ On properties of pebble assignment graphs
This page was built for publication: Integer-programming bounds on pebbling numbers of Cartesian-product graphs
