An algorithm for a separable integer programming problem with cumulatively bounded variables

DOI10.1016/0166-218X(87)90070-9zbMath0624.90071WikidataQ56324145 ScholiaQ56324145MaRDI QIDQ579126

Jianyong Qiao, Sumit K. Garg

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationobjective functionlexicographically largest optimal solutionseparable concave

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Related Items (3)

An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints ⋮ On an optimization problem with nested constraints ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems

Cites Work

• A separable integer programming problem equivalent to its continual version
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• A note on bicriterion programming
• Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Multiple-Choice Nested Knapsack Model
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort

This page was built for publication: An algorithm for a separable integer programming problem with cumulatively bounded variables