A branch and bound network approach to the canonical constrained entropy problem

DOI10.1016/0895-7177(95)00093-HMaRDI QIDQ1900273zbMATH OpenFDO

Authors J. R. Willems, A. Victor Cabot

Publication date 26 March 1996

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundregional planningconstrained entropy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Measures of information, entropy (94A17)

Recommendations

• scientific article; zbMATH DE number 4136860
• Models and algorithms of the entropy programming
• Models and algorithms of the entropy programming
• Publication:4887679
• Constrained Entropy Models; Solvability and Sensitivity

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3286661 (Why is no real title available?)
• A Maximum Entropy Analysis of the G/G/1 Queue at Equilibrium
• An Algorithm for Separable Nonconvex Programming Problems
• Constrained Entropy Models; Solvability and Sensitivity
• Maximum Entropy Condition in Queueing Theory

This page was built for publication: A branch and bound network approach to the canonical constrained entropy problem

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