A decomposition technique for mixed integer programming problems

DOI10.1016/0305-0548(92)90005-PzbMath0761.90075OpenAlexW2092410161MaRDI QIDQ1206388

Krishan Rana

Publication date: 1 April 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(92)90005-p

zbMATH Keywords

optimality conditionsLagrangean relaxationblock angular structureairline routing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• Decomposition Principle for Linear Programs
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• A Method of Decomposition for Integer Programs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• On convergence rates of subgradient optimization methods
• A Survey of Lagrangean Techniques for Discrete Optimization
• Cross decomposition for mixed integer programming
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: A decomposition technique for mixed integer programming problems