Integer programming approaches for minimum stabbing problems

DOI10.1051/ro/2014008zbMath1295.90021OpenAlexW2129103259MaRDI QIDQ5418014

Yuri Frota, Breno Piva, Luidi Simonetti, Cid Carvalho De Souza

Publication date: 26 May 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2014__48_2_211_0/

zbMATH Keywords

integer programmingLagrangian relaxationbranch-and-boundbranch-and-cutstabbing problems

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

This page was built for publication: Integer programming approaches for minimum stabbing problems