Skip to main navigation
Skip to search
Skip to main content
Experts@Syracuse Home
Help & FAQ
Home
Profiles
Research units
Research output
Equipment
Grants
Activities
Press and Media
Prizes
Search by expertise, name or affiliation
Minimum-cost flow problems having arc-activation costs
Robert M. Curry,
J. Cole Smith
College of Engineering & Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Minimum-cost flow problems having arc-activation costs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Minimum Cost Flow
100%
Activation
80%
Network Flow Problem
62%
Mixed Integer Programming
57%
Arc of a curve
57%
Costs
49%
Wireless Sensor Networks
33%
Network Optimization
33%
Dynamic Networks
32%
Infrastructure
31%
Network Flow
30%
Series
27%
Symmetry Breaking
27%
Programming Model
26%
Terminate
25%
Efficacy
24%
Schedule
23%
Charge
22%
Computational Results
22%
Optimal Solution
19%
Upper and Lower Bounds
19%
Optimization
17%
Optimization Problem
16%
Path
15%
Alternatives
14%
Relationships
13%
Demonstrate
13%
Business & Economics
Activation
66%
Network Flow
45%
Mixed Integer Programming
37%
Wireless Sensor Networks
27%
Symmetry Breaking
26%
Network Flow Problem
26%
Costs
25%
Network Optimization
24%
Fixed Charge
24%
Upper Bound
17%
Lower Bounds
16%
Efficacy
16%
Optimization Problem
15%
Optimal Solution
14%
Schedule
13%
Alternatives
8%
Engineering & Materials Science
Chemical activation
61%
Integer programming
48%
Costs
25%
Relaxation
21%
Wireless sensor networks
17%