Refinement of Lagrangian bounds in optimization problems
From MaRDI portal
Recommendations
Cites work
- A Survey of Lagrangean Techniques for Discrete Optimization
- About Lagrangian methods in integer optimization
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 2096252 (Why is no real title available?)
- Interior point methods of mathematical programming
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean relaxation. (With comments and rejoinder).
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(3)
This page was built for publication: Refinement of Lagrangian bounds in optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6122370)