Refinement of Lagrangian bounds in optimization problems
From MaRDI portal
Publication:6122370
DOI10.1134/s0965542507070032MaRDI QIDQ6122370
Publication date: 1 March 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/zvmmf275
Related Items (3)
Integrating territory design and routing problems ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About Lagrangian methods in integer optimization
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Interior point methods of mathematical programming
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Lagrangean relaxation. (With comments and rejoinder).
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- A Survey of Lagrangean Techniques for Discrete Optimization
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: Refinement of Lagrangian bounds in optimization problems
