Discrete relaxations of combinatorial programs

0Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

This paper investigates a technique of building up discrete relaxations of combinatorial optimization problems. To establish such a relaxation we introduce a transformation technique - aggregation - that allows one to relax an integer program by means of another integer program. We show that knapsack and set packing relaxations give rise to combinatorial cutting planes in a simple and straightforward way. The constructions are algorithmic. © 2001 Elsevier Science B.V.

Cite

CITATION STYLE

APA

Borndörfer, R., & Weismantel, R. (2001). Discrete relaxations of combinatorial programs. Discrete Applied Mathematics, 112(1–3), 11–26. https://doi.org/10.1016/S0166-218X(00)00307-3

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