scientific article; zbMATH DE number 1501879
From MaRDI portal
Publication:4503045
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
Cited in
(9)- Approximation algorithms for fractional knapsack problems
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- scientific article; zbMATH DE number 3976783 (Why is no real title available?)
- Fractional 0-1 programming: applications and algorithms
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Dualité lagrangienne en programmation fractionnaire concave-convexe en variables 0–1
- Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem
- Hybrid column generation for large-size covering integer programs: application to transportation planning
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)
