Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- 05C82 (1)
- 62H20 (1)
- 90B10 (1)
- 90B18 (1)
- 92Bxx (1)
-
- 92D99 (1)
- 94A17 (1)
- Betweenness centrality (1)
- Biological network (1)
- Boolean network (1)
- Clustering coefficient (1)
- Cover inequalities (1)
- Cutting planes (1)
- Determinative power (1)
- Inequality merging (1)
- Integer programming (1)
- Knapsack constraints (1)
- MSC 90C10 (1)
- MSC 90C27 (1)
- MSC 90C39 (1)
- MSC90C57 (1)
- Pearson correlation (1)
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Boolean Network Topologies And The Determinative Power Of Nodes, Bronson W. Wacker, Mihaela T. Velcsov, Jim A. Rogers
Boolean Network Topologies And The Determinative Power Of Nodes, Bronson W. Wacker, Mihaela T. Velcsov, Jim A. Rogers
Mathematics Faculty Publications
Boolean networks have been used extensively for modeling networks whose node activity could be simplified to a binary outcome, such as on-off. Each node is influenced by the states of the other nodes via a logical Boolean function. The network is described by its topological properties which refer to the links between nodes, and its dynamical properties which refer to the way each node uses the information obtained from other nodes to update its state. This work explores the correlation between the information stored in the Boolean functions for each node in a property known as the determinative power and …
Approximate And Exact Merging Of Knapsack Constraints With Cover Inequalities, Fabio Vitor, Todd Easton
Approximate And Exact Merging Of Knapsack Constraints With Cover Inequalities, Fabio Vitor, Todd Easton
Mathematics Faculty Publications
This paper presents both approximate and exact merged knapsack cover inequalities, a class of cutting planes for knapsack and multiple knapsack integer programs. These inequalities combine the information from knapsack constraints and cover inequalities. Approximate merged knapsack cover inequalities can be generated through a O(n log n) algorithm, where n is the number of variables. This class of inequalities can be strengthened to an exact version with a pseudo-polynomial time algorithm. Computational experiments demonstrate an average improvement of approximately 8% in solution time and 5% in the number of ticks from CPLEX when approximate merged knapsack cover …