Pages that link to "Item:Q336604"

The following pages link to Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604):

Displaying 13 items.

• Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490) (← links)
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack (Q1652633) (← links)
• A study of network violator interception based on a reliable game model (Q1717694) (← links)
• Optimal detection of critical nodes: improvements to model structure and performance (Q2005802) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• The connected critical node problem (Q2672625) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire (Q5865822) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• The stochastic critical node problem over trees (Q6092626) (← links)
• Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)