Using integer programming to search for counterexamples: a case study

From MaRDI portal

Revision as of 10:48, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2663722

Jump to:navigation, search

DOI10.1007/978-3-030-49988-4_5zbMath1476.05101OpenAlexW3037206882MaRDI QIDQ2663722

Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi

Publication date: 19 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-49988-4_5

zbMATH Keywords

Hamiltonian graph integer linear programming toughness

Mathematics Subject Classification ID

Integer programming (90C10) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items (4)

A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework ⋮ A computational status update for exact rational mixed integer programming ⋮ A computational status update for exact rational mixed integer programming

This page was built for publication: Using integer programming to search for counterexamples: a case study

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2663722&oldid=15487952"