Pages that link to "Item:Q2327149"
From MaRDI portal
The following pages link to Integer-programming bounds on pebbling numbers of Cartesian-product graphs (Q2327149):
Displaying 9 items.
- On properties of pebble assignment graphs (Q2115162) (← links)
- Computing bounds on product graph pebbling numbers (Q2283021) (← links)
- Cycles and girth in pebble assignment graphs (Q2676758) (← links)
- A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture (Q5883707) (← links)
- A computational status update for exact rational mixed integer programming (Q5918427) (← links)
- A computational status update for exact rational mixed integer programming (Q5925645) (← links)
- (Q6113436) (← links)
- Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework (Q6202766) (← links)
- Automating weight function generation in graph pebbling (Q6202944) (← links)