scientific article; zbMATH DE number 1501879

zbMATH Open0997.90084MaRDI QIDQ4503045FDOQ4503045

Gérard Plateau, A. Nagih

Publication date: 7 November 2002

Title of this publication is not available (Why is that?)

Recommendations

• Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
• Lagrangean methods for the 0-1 quadratic knapsack problem
• Lagrangean methods for 0-1 quadratic problems
• Decomposition and linearization for 0-1 quadratic programming
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

zbMATH Keywords

fractional programmingLagrangean relaxation0-1 integer programmingLagrangean decomposition

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Fractional programming (90C32) Decomposition methods (49M27)

Cited In (8)

• Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Fractional 0-1 programming: applications and algorithms
• Title not available (Why is that?)
• Hybrid column generation for large-size covering integer programs: application to transportation planning
• Approximation algorithms for fractional knapsack problems
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503045)