Skip to main navigation
Skip to search
Skip to main content
University of Arizona Home
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Grants
Datasets
Prizes
Search by expertise, name or affiliation
On the minimum-cost λ -edge-connected k-subgraph problem
Elham Sadeghi,
Neng Fan
Systems and Industrial Engineering
Applied Mathematics - GIDP
Statistics - GIDP
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the minimum-cost λ -edge-connected k-subgraph problem'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Business & Economics
Integer Programming
100%
Minimum Spanning Tree
66%
Graph
43%
Costs
34%
Valid Inequalities
33%
Clique
31%
Numerical Experiment
23%
Mathematics
Subgraph
75%
Costs
66%
Integer Programming
49%
Formulation
28%
Minimum Spanning Tree
28%
Valid Inequalities
14%
Spanning Subgraph
13%
Clique
11%
Graph in graph theory
10%
Numerical Experiment
8%
Generalization
5%
Engineering & Materials Science
Integer programming
98%
Costs
34%
Experiments
8%