Lifting, tilting and fractional programming revisited

DOI10.1016/j.orl.2010.08.007zbMath1202.90199OpenAlexW2029207664MaRDI QIDQ614041

Ricardo Fukasawa, Marcos Goycoolea, Daniel G. Espinoza

Publication date: 23 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/143024

zbMATH Keywords

tiltingliftingfractional programmingmixed-integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Fractional programming (90C32)

Related Items (5)

Local cuts for mixed-integer programming ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs

Uses Software

• WinGULF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear-fractional programming. Theory, methods, applications and software.
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• Parametric linear fractional programming for an unbounded feasible region
• Some polyhedra related to combinatorial problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Fractional Programming. II, On Dinkelbach's Algorithm
• On the facial structure of set packing polyhedra
• On Nonlinear Fractional Programming
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

This page was built for publication: Lifting, tilting and fractional programming revisited