Novel upper bounds for the constrained most probable explanation task
Abstract
Supplementary Material
- Download
- 13.91 MB
References
Index Terms
- Novel upper bounds for the constrained most probable explanation task
Recommendations
Lower and upper bounds for the degree-constrained minimum spanning tree problem
In this paper, we propose a Lagrangian Non-Delayed Relax-and-Cut algorithm for the Degree-Constrained Minimum Spanning Tree Problem (DCMSTP). Since degree-constrained trees are the common vertices of the Spanning Tree and the b-Matching polytopes, ...
Quadratic resource allocation with generalized upper bounds
In this paper we present an algorithm for solving a quadratic resource allocation problem that includes a set of generalized upper bound (GUB) constraints. The problem involves minimizing a quadratic function over one linear constraint, a set of GUB ...
New bounds for nonconvex quadratically constrained quadratic programming
AbstractIn this paper, we study some bounds for nonconvex quadratically constrained quadratic programs (QCQPs). We propose two types of bounds for QCQPs, quadratic and cubic bounds. We use affine functions as Lagrange multipliers for quadratic bounds. We ...
Comments
Information & Contributors
Information
Published In
Publisher
Curran Associates Inc.
Red Hook, NY, United States
Publication History
Qualifiers
- Research-article
- Research
- Refereed limited
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0