Heuristics of the Branch-Cut-and-Price-Framework SCIP
type: Item
instance of: scholarly article
title: Heuristics of the Branch-Cut-and-Price-Framework SCIP
zbMATH Open document ID: 1209.90356
DOI: 10.1007/978-3-540-77903-2_5
author: Timo Berthold
published in: Operations Research Proceedings
publication date: 2011-04-07T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90-04
zbMATH DE Number: 5875868
describes a project that uses: FEASPUMP
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: MIPLIB
MaRDI profile type: Publication
full work available at URL: 978-3-540-77903-2 5
OpenAlex ID: W2157072141
cites work: Q5241193
cites work: Improving the feasibility pump
cites work: SCIP: solving constraint integer programs
cites work: MIPLIB 2003
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: The feasibility pump
cites work: Local branching
description: scientific article; zbMATH DE number 5875868