Lifting, tilting and fractional programming revisited

Authors:
Daniel Espinoza;Ricardo Fukasawa;Marcos Goycoolea
Affiliations:
Departamento de Ingeniería Industrial, Universidad de Chile, Chile;Department of Combinatorics and Optimization, University of Waterloo, Canada;School of Business, Universidad Adolfo Ibañez, Diagonal Las Torres 2640, Office 534C, Penanolen, Santiago 7941169, Chile
Venue:
Operations Research Letters
Year:
2010

Citing 3
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
TSP Cuts Which Do Not Conform to the Template Paradigm

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Lifted Cover Inequalities for 0-1 Integer Programs: Computation

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lifting, tilting and fractional programming, though seemingly different, reduce to a common optimization problem. This connection allows us to revisit key properties of these three problems on mixed integer linear sets. We introduce a simple common framework for these problems, and extend known results from each to the other two.