A decomposition technique for mixed integer programming problems

DOI10.1016/0305-0548(92)90005-PMaRDI QIDQ1206388zbMATH OpenOpenAlexFDO

Authors 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

airline routingblock angular structureLagrangean relaxationoptimality conditions

Mathematics Subject Classification ID

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

Recommendations

• Lagrangean decomposition for integer programming : theory and applications
• Mixed decomposition in block integer linear programming problems
• Multilevel decomposition in mixed-integer block programming
• Decomposition in integer linear programming
• Lagrangean decomposition: A model yielding stronger lagrangean bounds

Cites work

• A Method of Decomposition for Integer Programs
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• A Survey of Lagrangean Techniques for Discrete Optimization
• Cross decomposition for mixed integer programming
• Decomposition Principle for Linear Programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• scientific article; zbMATH DE number 3554017 (Why is no real title available?)
• scientific article; zbMATH DE number 3566546 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• On convergence rates of subgradient optimization methods
• Partitioning procedures for solving mixed-variables programming problems
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II

Cited in

(13)

• Layering strategies for creating exploitable structure in linear and integer programs
• Multilevel decomposition in mixed-integer block programming
• Solving mixed integer classification problems by decomposition
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
• A decomposition approach to the solution of some integer programming problems with inexact data
• Decomposition in integer linear programming
• scientific article; zbMATH DE number 3898614 (Why is no real title available?)
• scientific article; zbMATH DE number 2000146 (Why is no real title available?)
• Decomposition Branching for Mixed Integer Programming
• scientific article; zbMATH DE number 6444271 (Why is no real title available?)
• A recombination‐based matheuristic for mixed integer programming problems with binary variables
• Mixed decomposition in block integer linear programming problems

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

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