Primal separation algorithms

DOI10.1007/s10288-003-0012-8zbMath1102.90074OpenAlexW1800762347MaRDI QIDQ1416099

Andrea Lodi, Adam N. Letchford

Publication date: 2003

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://dblp.uni-trier.de/db/journals/4or/4or1.html#LetchfordL03

zbMATH Keywords

Integer programmingknapsack problemseparationprimal algorithmsstable set problemtravelling salesman problem.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Integral simplex using decomposition with primal cutting planes

This page was built for publication: Primal separation algorithms