The continuous multiple-modular design problem

DOI10.1002/nav.3800300203zbMath0536.90054OpenAlexW2044779159MaRDI QIDQ3321830

Timothy L. Shaftel, Gerald L. Thompson

Publication date: 1983

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800300203

zbMATH Keywords

branch-and-boundresource allocationlogisticsguillotine partitionsheuristic proceduresKuhn-Tucker conditionspartial enumerationcontinuous multiple-modular design

Mathematics Subject Classification ID

Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items (2)

The continuous modular design problem with linear separable side constraints ⋮ Generalized bilinear programming. I: Models, applications and linear programming relaxation

Cites Work

• Unnamed Item
• Unnamed Item
• The Diclique Representation and Decomposition of Binary Relations
• On the Addressing Problem for Loop Switching
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: The continuous multiple-modular design problem