Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program

DOI10.1287/opre.32.5.1185zbMath0555.90074OpenAlexW2045357527MaRDI QIDQ3220353

James C. Bean

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.32.5.1185

zbMATH Keywords

Lagrangean relaxationcomputational resultsbranch and bound algorithmrandomly generated problemslarge size problemsGUB constraintsLagrangean alterationmultiple choice integer programvariable reduction technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items (4)

A solution procedure for general knapsack problems with a few constraints ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ A decomposition technique for mixed integer programming problems ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming

This page was built for publication: Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program