On an optimization problem with nested constraints

DOI10.1016/0166-218X(90)90098-WzbMath0691.90063WikidataQ56324124 ScholiaQ56324124MaRDI QIDQ583110

Alan M. Frieze, Martin Dyer

Publication date: 1990

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

zbMATH Keywords

nested constraints

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

A short proof of optimality of the bottom up algorithm for discrete resource allocation problems ⋮ A polynomial algorithm for resourse allocation problems with polymatroid constrains¹ ⋮ Optimal binary trees with order constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for a separable integer programming problem with cumulatively bounded variables
• A separable integer programming problem equivalent to its continual version
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Time bounds for selection
• 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

This page was built for publication: On an optimization problem with nested constraints