Skip to main content
Book Chapter

Cutting Plane Methods

  • Eiselt H
  • Sandblom C
Springer Berlin Heidelberg, (2000), 187-204
DOI: 10.1007/978-3-662-04197-0_9
N/ACitations
Citations of this article
62Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a...

Cite

CITATION STYLE

APA

Eiselt, H. A., & Sandblom, C.-L. (2000). Cutting Plane Methods. In Integer Programming and Network Models (pp. 187–204). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-04197-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free