Computer Science
Valid Inequality
59%
Cutting Plane Algorithm
47%
Integer Program
45%
Integer Programming
39%
Wireless Sensor Network
35%
Attackers
31%
Mixed Integer Programming
30%
Traveling Salesman Problem
29%
Directed Graphs
26%
Randomly Generated Instance
25%
mobile sink
23%
binary decision diagram
23%
Distributed Algorithm
23%
Dynamic Programming Algorithm
23%
Subgraphs
23%
Packing Problem
23%
Optimization Problem
19%
Capacity Constraint
17%
Linear Programming
17%
Dynamic Programming
17%
Linear Program
17%
Computational Effort
17%
Discretization
16%
Destination Node
15%
Polynomial Time
15%
System Analysis
15%
Directed Network
15%
Column Generation
15%
Tree Network
15%
Programming Model
12%
Message Passing
11%
If Statement
11%
Failure Scenario
11%
Graph Search Problem
11%
Image Processing Technique
11%
Tree Graph
11%
Optimization Technique
11%
Classic Formulation
11%
Minimum Cost Path
11%
Problem Selection
11%
Communication Network
11%
Programming Technique
11%
Discrete Variable
11%
Connected Component
11%
Analysis Technique
11%
single machine scheduling problem
11%
Radiation Treatment
11%
Treatment Strategy
11%
Replacement Cost
11%
Network Element
11%
Engineering
Nodes
100%
Cutting Plane
59%
Reformulation
47%
Wireless Sensor Network
26%
Interdiction
23%
Stage Game
23%
Dynamic Programming
23%
Temperature Estimation
23%
Thermal Model
19%
Failure Scenario
19%
Binary Variable
17%
Optimisation Problem
17%
Routing Problem
15%
Linear Programming
15%
Energy Engineering
14%
Heuristic Technique
14%
Flow Problem
14%
Fixed Costs
14%
Subproblem
12%
Illustrates
12%
Processing Time
11%
Collision Risk
11%
Enhanced Model
11%
Fixed Set
11%
Probe Set
11%
Minimal Number
11%
Modeling Concept
11%
Sensor Network
11%
Network Lifetime
11%
Product Introduction
11%
Maximization
11%
Supply Availability
11%
Multistage
11%
Initial Position
11%
Collision Detection
11%
Model Parameter
10%
Initial Location
9%
Node Pair
8%
Computational Time
8%
Transmissions
7%
Finite Set
6%
Planning Horizon
5%
Mixed-Integer Programming Model
5%
Failure Probability
5%
Fuel Cost
5%
Federal Aviation Administration
5%
Feasible Region
5%
Predetermined Number
5%
Network Element
5%
Rationality
5%
Keyphrases
Interdiction Problems
47%
Interdiction
47%
Mixed Integer Programming
26%
Shortest Path
26%
Economies of Scale
23%
Network Interdiction
23%
Reformulation-linearization Technique
23%
Contract Signing
23%
Procurement Cost
20%
Interdiction Models
17%
Operations Research
17%
Capacitated
17%
NP-hard
17%
Maximum Flow Problem
15%
Wireless Sensor Networks
15%
Remaining Capacity
15%
Series-parallel Graphs
15%
Convex Hull Representation
14%
Robust Optimization
14%
Delay Tolerant
11%
Three-stage Game
11%
Sampling Framework
11%
Imperfect Sensors
11%
Integer Decomposition
11%
Minimum Cost Flow Problem
11%
Conflict Analysis
11%
Lyapunov Drift
11%
Occupancy Analysis
11%
Queue Size
11%
Distributed Execution
11%
Bi-level
11%
Survivable Network Design Problem
11%
Tree Graph
11%
Airspace Sector
11%
Node Capacity
11%
Enhanced Model
11%
Loading Problem
11%
Strategy Complexity
11%
Random Variate Generation
11%
Alias Method
11%
Lifetime Maximization
11%
Robust Sensor
11%
Mobile Sink
11%
Close Enough Traveling Salesman Problem
11%
Edge-partition Problems
11%
Cutting Plane Algorithm
11%
Nondecreasing
11%
Single Machine Scheduling Problem
11%
Cutting Planes
11%
Node Reliability
11%
